2188-Frames ZCMU

Description

Throughout Igor K.'s life he has had many situations worthy of attention. We remember the story with the virus, the story of his mathematical career and of course, his famous programming achievements. However, one does not always adopt new hobbies, one can quit something as well.

This time Igor K. got disappointed in one of his hobbies: editing and voicing videos. Moreover, he got disappointed in it so much, that he decided to destroy his secret archive for good.

Igor K. use Pindows XR operation system which represents files and folders by small icons. At that, m icons can fit in a horizontal row in any window.

Igor K.'s computer contains n folders in the D: disk's root catalog. The folders are numbered from 1 to n in the order from the left to the right and from top to bottom (see the images). At that the folders with secret videos have numbers from a to b inclusive. Igor K. wants to delete them forever, at that making as few frame selections as possible, and then pressing Shift+Delete exactly once. What is the minimum number of times Igor K. will have to select the folder in order to select folders from a to b and only them? Let us note that if some selected folder is selected repeatedly, then it is deselected. Each selection possesses the shape of some rectangle with sides parallel to the screen's borders.

Input

The only line contains four integers n, m, a, b (1≤n,m≤109, 1≤a≤b≤n). They are the number of folders in Igor K.'s computer, the width of a window and the numbers of the first and the last folders that need to be deleted.

Output

Print a single number: the least possible number of times Igor K. will have to select the folders using frames to select only the folders with numbers from a to b.

Examples

Input

11 4 3 9

Output

3

Input

20 5 2 20

Output

2

Note

The images below illustrate statement tests.

The first test:

In this test we can select folders 3 and 4 with out first selection, folders 5, 6, 7, 8 with our second selection and folder 9 with our third, last selection.

The second test:

In this test we can first select all folders in the first row (2, 3, 4, 5), then − all other ones.

题意：

就是删除文件夹最少需要几次，每次只能框一个矩形删除。n是总共文件夹数。m是一行几个文件夹。ab是要删的首尾文件夹序号。

思路：

分三种情况：

1.在同一行删一次。

2.隔一行：首尾顶格删一次，不顶格删两次。

3.隔两行以上：首尾顶格删一次。首尾都不顶格，删3次。有一个顶格删2次

ps：有大佬考虑到如果隔两行以上：尾文件的列比首文件的列少1，那么可以删两次。但是去oj上测试，答案是2或者3都可以ac啦，大佬想的比较多啦~

ac代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m,a,b;
    while(scanf("%d%d%d%d",&n,&m,&a,&b)!=)EOF
    {
        int c1,c2;
        c1=a/m; //a所在的层数
        c2=b/m;   //b所在的层数
        if(c2==c1) //ab同一行的情况
            printf("1\n");
        else if(c2-c1==1) //首尾相差一行的情况
        {
            if((b-a+1)%m==0) //如果首尾都顶格，一次删除 
                printf("1\n");
            else
                printf("2\n");
        }
        else if(c2-c1>=2)//首尾隔2行以上的情况
        {
            if(b%m==0&&a%m==1) //首尾顶格 能一起删除
                printf("1\n");
            else if(b%m!=0&&a%m!=1) //都不顶格，三次 
                printf("3\n");
            else
                printf("2\n");//有一个顶格 
        }
    }
    return 0;
    }