Problem: 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:

<image>

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:

<image>

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

Solution (in JAVA):

Solution:
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
 
public class Main {
 
	private BufferedReader input;
	private PrintWriter output;
	private StringTokenizer stoken;
 
	String fin = "input";
	String fout = "output";
 
 
	private void solve() {

		/*
		String st = nextToken();
		String[] mas = new String[8];
		for (int i=0; i<8; i++) {
			mas[i] = st.substring(i*10, i*10+10);
		}
		

		String[] alf = new String[10];
		for (int i=0; i<10; i++) {
			alf[i] = nextToken();
		}

		
		String res = "";
		
		for (int i=0; i<8; i++) {
			for (int j=0; j<10; j++) {
				if ( mas[i].equals(alf[j]) ) {
					//mas[j] = ")";
					res += String.valueOf(j);
					break;
				}
			}
		}
		
		
		
		output.print(res);
		*/
		
		
		/*
		int n = nextInt();
		
		int[][] mas = new int[5][5];
		
		for (int i=0; i<n; i++) {
			int a = nextInt() - 1;
			int b = nextInt() - 1;
			mas[a][b] = 1;
			mas[b][a] = 1;
		}
		
		
		boolean win = false;
		
		for (int i=0; i<5; i++) {
			for (int j=0; j<5; j++) {
				for (int k=0; k<5; k++) {
					if (i != j && j != k && i != k) {
						//know 3
						if ( mas[i][j] == 1 && mas[i][k] == 1 && mas[j][k] == 1 ) {
							win = true;
							break;
						}
						//unknow 3
						if ( mas[i][j] == 0 && mas[i][k] == 0 && mas[j][k] == 0 ) {
							win = true;
							break;
						}
					}
				}
				if (win) break;
			}
			if (win) break;
		}

		
		if (win) {
			output.print("WIN");
		} else {
			output.print("FAIL");
		}
		*/


		int n = nextInt();
		int line = nextInt();
		int a = nextInt();
		int b = nextInt();
		
		int fromLine = a / line;
		if (a % line == 0) fromLine--;

		int toLine = b / line;
		if (b % line == 0) toLine--;
		
		//1
		if ( (fromLine == toLine) || ( (a-1)%line == 0 && b%line == 0) || ((a-1)%line == 0 && b==n) ) {
			output.print(1);
		} else {
			if ( (a-1)%line == 0 || (b%line == 0) ) {
				output.print(2);
			} else {
				int count = b - a + 1;
				int ost = count - (count / line)*line;
				if (ost == 0 || (fromLine == toLine - 1) || (b == n) ) {
					output.print(2);
				} else {
					output.print(3);
				}
			}
		}
		
		


	}
 
	
	
 
 
	Main() throws IOException {
		//input = new BufferedReader(new FileReader(fin + ".txt"));
		input = new BufferedReader(new InputStreamReader(System.in));
		
		output = new PrintWriter(System.out);
 
 
		solve();
 
		input.close();
		output.flush();
		output.close();
	}
 
 
	int nextInt() {
		return Integer.parseInt(nextToken());
	}
 
	long nextLong() {
		return Long.parseLong(nextToken());
	}
 
	double nextFloat() {
		return Float.parseFloat(nextToken());
	}
 
	double nextDouble() {
		return Double.parseDouble(nextToken());
	}
 
	String nextToken() {
		while ((stoken == null) || (!stoken.hasMoreTokens())) {
			try {
				String line = input.readLine();
				stoken = new StringTokenizer(line);
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return stoken.nextToken();
	}
 
 
 
	public static void main(String[] args) throws IOException {
		new Main();
	}
 
}