#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = 1005;
vector<int> a[maxn];
int n, k;
int x[maxn], y[maxn], dist[maxn * maxn];
int take[maxn];
bool dfs(int v, int k) {
  if (v == n) return k >= 0;
  if (take[v]) return dfs(v + 1, k);
  int cnt = 0;
  for (int i = 0; i < (int)(a[v]).size(); i++) {
    if (take[a[v][i]] == 0) {
      k--;
      cnt++;
    }
    take[a[v][i]]++;
  }
  if (k >= 0 && dfs(v + 1, k)) return true;
  for (int i = 0; i < (int)(a[v]).size(); i++) {
    if (take[a[v][i]] == 1) {
      k++;
    }
    take[a[v][i]]--;
  }
  take[v]++;
  if (k - 1 >= 0 && cnt > 1 && dfs(v + 1, k - 1)) return true;
  take[v]--;
  return false;
}
bool check(int m) {
  for (int i = 0; i < n; i++) {
    take[i] = 0;
    a[i].clear();
  }
  for (int i = 0; i < n - 1; i++) {
    for (int j = i + 1; j < n; j++) {
      if ((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) > m) {
        a[i].push_back(j);
        a[j].push_back(i);
      }
    }
  }
  return dfs(0, k);
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  int e = 0;
  dist[e++] = 0;
  for (int i = 0; i < n - 1; i++) {
    for (int j = i + 1; j < n; j++) {
      dist[e++] = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
    }
  }
  sort(dist, dist + e);
  e = unique(dist, dist + e) - dist;
  int l = -1;
  int r = e - 1;
  while (l < r - 1) {
    int m = (l + r) >> 1;
    if (check(dist[m])) {
      r = m;
    } else {
      l = m;
    }
  }
  check(dist[r]);
  for (int i = 0; i < n; i++) {
    if (take[i]) {
      printf("%d ", i + 1);
      k--;
    }
  }
  for (int i = 0; i < n; i++) {
    if (!take[i] && k > 0) {
      printf("%d ", i + 1);
      k--;
    }
  }
  return 0;
}
