D. Minimum Diametertime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n points on the plane. You need to delete exactly k of them (k < n) so that the diameter of the set of the remaining n - k points were as small as possible. The diameter of a set of points is the maximum pairwise distance between the points of the set. The diameter of a one point set equals zero.InputThe 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 xi, yi (0 ≤ xi, yi ≤ 32000) — the coordinates of the i-th point. The given points can coincide.OutputPrint 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.ExamplesInput5 21 20 02 21 13 3Output5 2Input4 10 00 01 11 1Output3
Input5 21 20 02 21 13 3
Output5 2
['binary search', 'brute force', '*3100']