You are given *n* points on the plane. You need to delete exactly *k* of them (*k* &lt; *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.
The first input line contains a pair of integers *n*, *k* (2 ≤ *n* ≤ 1000, 1 ≤ *k* ≤ 30, *k* &lt; *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*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> (0 ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 32000) — the coordinates of the *i*-th point. The given points can coincide.
print("_RANDOM_GUESS_1692704666.3079367")# 1692704666.30795