Mowing the Field

Farmer John is quite reliable in all aspects of managing his farm, except one: he is terrible at mowing the grass in a timely fashion. He only manages to move the mowing machine once per day, in fact. On day 1 he starts at position (x[1], y[1]) and on day d he mows along a straight segment to the position (x[d], y[d]), moving either horizontally or vertically on the 2D map of his farm; that is, either x[d] = x[d−1], or y[d] = y[d−1]. FJ alternates between horizontal and vertical moves on successive days.

So slow is FJ's progress that some of the grass he mows might grow back before he is finished with all his mowing. Any section of grass that is cut in day d will reappear on day d + t, so if FJ's mowing path crosses a path he cut at least t days earlier, he will end up cutting grass at the same point again. In an effort to try and reform his poor mowing strategy, FJ would like to count the number of times this happens.

Count the number of times FJ's mowing path crosses over an earlier segment on which grass has already grown back. You should only count "perpendicular" crossings, defined as a point in common between a horizontal and a vertical segment that is an endpoint of neither.

Input

The first line contains n (2 ≤ n ≤ 10^5) and t (1 ≤ t ≤ n, t is even). The next n lines describe the position of the mower on days 1..n. The ith of these lines contains integers x[i] and y[i] (nonnegative integers each at most 10^9).

Output

Print a count of the number of crossing points described above, where FJ re-cuts a point of grass that had grown back after being cut earlier.

Examples

Note

Here, FJ crosses on day 7 a segment of grass he cut on day 2, which counts. The other intersections do not count.