Minimum Diameter

Description:

Input:

The first input line contains a pair of integers n, k (2 ≤ n ≤ 1000, 1 ≤ k ≤ 30, k < n) — the numbers of points on the plane and the number of points to delete, correspondingly.

Next n lines describe the points, one per line. Each description consists of a pair of integers x_i, y_i (0 ≤ x_i, y_i ≤ 32000) — the coordinates of the i-th point. The given points can coincide.

Output:

Print k different space-separated integers from 1 to n — the numbers of points to delete. The points are numbered in the order, in which they are given in the input from 1 to n. You can print the numbers in any order. If there are multiple solutions, print any of them.

Sample Input:

5 2
1 2
0 0
2 2
1 1
3 3

Sample Output:

5 2

Sample Input:

4 1
0 0
0 0
1 1
1 1

Sample Output:

3