CF164D.Minimum Diameter

You 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.

给你平面上的 $n$ 个点。你需要恰好删除其中的 $k$ 个点（$k < n$），使得剩余的 $n - k$ 个点构成的点集的直径尽可能小。点集的直径定义为该点集中所有点对之间距离的最大值。单点集的直径定义为零。

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.

第一行输入包含两个整数 $n$ 和 $k$（$2 \leq n \leq 1000$，$1 \leq k \leq 30$，且 $k < n$），分别表示平面上的点数以及需要删除的点数。

接下来 $n$ 行描述这些点，每行一个点。每行描述包含一对整数 $x_i,\ y_i$（$0 \leq x_i,\ y_i \leq 32000$），表示第 $i$ 个点的坐标。给定的点可以重合。

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.

输出 k 个互不相同、以空格分隔的整数（取值范围为 1 到 n）——这些整数表示需要删除的点的编号。点的编号按照输入中给出的顺序从 1 到 n 编号。你可以以任意顺序输出这些数字。若存在多种可行解，输出任意一种即可。