The university of A stages a programming contest this year as has been the case in the past. As a member of the team in charge of devising the problems, you have worked out a set of input data for a problem, which is an arrangement of points on a 2D plane in the coordinate system. The problem requires that any combination of these points greater than or equal to $K$ in number must not align on a line. You want to confirm that your data satisfies this requirement.

Given the number of points $K$ and their respective 2D coordinates, make a program to check if any combination of points greater or equal to $K$ align on a line.



Input

The input is given in the following format.


$N$ $K$
$x_1$ $y_1$
$x_2$ $y_2$
$...$
$x_N$ $y_N$


The first line provides the number of points $N$ ($3 \leq N \leq 3000$) on the 2D coordinate system and an integer $K$ ($3 \leq K \leq N$). Each of the subsequent lines provides the $i$-th coordinate $x_i,y_i$ ($0 \leq x_i,y_i \leq 10000$) as integers. None of these coordinates coincide, i.e., if $i \ne j$, then $x_i \ne x_j$ or $y_i \ne y_j$.

Output

Output 1 if any combination of points greater or equal to $K$ aligns on a line, or 0 otherwise.

Examples

Input

5 4
0 0
1 0
1 1
0 1
2 2


Output

0


Input

7 5
0 0
1 0
1 1
0 1
2 0
3 0
4 0


Output

1
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

int n, k, c, s = 0;
int x[3000], y[3000];
double a[3000];

int main()
{
	cin >> n >> k;

	for (int i = 0; i < n; i++)
		cin >> x[i] >> y[i];

	for (int i = 0; i < n - k + 1; i++) {
		memset(a, 0, sizeof(a));
		for (int t = 0; t < n - i - 1; t++) {
			if (x[t + i + 1] == x[i])
				a[t] = 10001;
			else
				a[t] = double(y[t + i + 1] - y[i]) / double(x[t + i + 1] - x[i]);
		}
		sort(a, a + n - i - 1);

		c = 0;
		for (int j = 0; j < n - i - 2; j++) {
			if (a[j] == a[j + 1]) {
				c++;
				if (c == k - 2) {
					s = 1;
					break;
				}
			}
			else
				c = 0;
		}
		if (c == k - 2)
			break;
	}

	cout << s << endl;

	return 0;
}
