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.

Difficulty: MEDIUM_HARD
Tags: Implementation

Starter code:

Solutions:
import math
(n, m, a, b) = map(int, input().split())
if (a - 1) // m == (b - 1) // m:
	print(1)
elif (a - 1) % m == 0 and b % m == 0:
	print(1)
elif (a - 1) % m == 0 and b == n or m == 1:
	print(1)
elif (a - 1) % m == 0 or b % m == 0 or b == n:
	print(2)
elif abs((a - 1) // m - (b - 1) // m) == 1 or m == 2:
	print(2)
elif (a - 1) % m == b % m:
	print(2)
else:
	print(3)


(n, m, a, b) = map(int, input().split())
(r1, r2, c1, c2) = ((a - 1) // m, (b - 1) // m, (a - 1) % m, m - 1 if b == n else (b - 1) % m)
if r1 == r2 or (c1 == 0 and c2 == m - 1):
	print(1)
elif r2 == r1 + 1 or c1 == 0 or c2 == m - 1 or (c1 == c2 + 1):
	print(2)
else:
	print(3)


import os
import sys
from io import BytesIO, IOBase
import math
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
import math
for _ in range(1):
	(n, m, a, b) = map(int, input().split())
	r1 = (a - 1) // m
	r2 = (b - 1) // m
	c1 = (a - 1) % m + 1
	c2 = (b - 1) % m + 1
	if r1 == r2:
		print('1')
	elif c1 == 1 and (c2 == m or b == n):
		print('1')
	elif c1 == 1 or (c2 == m or b == n):
		print('2')
	elif r2 - r1 == 1:
		print('2')
	elif c1 == c2 + 1:
		print('2')
	else:
		print('3')


readints = lambda : map(int, input().strip('\n').split())
(n, m, a, b) = readints()
a -= 1
b -= 1
ra = a // m
rb = b // m
ia = a % m
ib = b % m
if ra == rb or (ia == 0 and b == n - 1) or (ia == 0 and ib == m - 1):
	print(1)
elif ia == 0 and ib < m - 1 and (b != n - 1) or (ia > 0 and (ib == m - 1 or b == n - 1)) or ra + 1 == rb or (ib + 1 == ia):
	print(2)
else:
	print(3)


import sys
from array import array

def input():
	return sys.stdin.buffer.readline().decode('utf-8')
(n, m, a, b) = map(int, input().split())
(a, b) = (a - 1, b - 1)
if b + 1 == n:
	b = (b // m + 1) * m - 1
if a // m == b // m:
	print(1)
elif a % m == 0 and b % m == m - 1:
	print(1)
elif b % m + 1 == a % m:
	print(2)
elif a // m + 1 == b // m:
	print(2)
else:
	ans = 1 + (a % m != 0) + (b % m != m - 1)
	print(ans)