#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 250005;
int n, k;
pii a[MN];
int cost(pii p, pii q) {
return abs(p.f - q.f) + abs(p.s - q.s);
}
bool cmp(pii p, pii q) {
return cost(a[p.f], a[p.s]) > cost(a[q.f], a[q.s]);
}
int32_t main() {
boost();
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i].f >> a[i].s;
if (n <= 1000) {
vector<int> v;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
v.push_back(cost(a[i], a[j]));
}
}
sort(v.begin(), v.end());
for (int i = 1; i <= k; i++) printf("%lld\n", v[i - 1]);
return 0;
}
sort(a + 1, a + n + 1);
priority_queue<pii, vector<pii>, decltype(&cmp)> q(cmp);
set<pii> vis;
for (int gap = 1; gap <= 75; gap++) {
for (int i = gap + 1; i <= n; i++) q.push({i - gap, i}), vis.insert({i - gap, i});
}
while (q.size() && k--) {
pii i = q.top(); q.pop();
printf("%lld\n", cost(a[i.f], a[i.s]));
if (i.s < n && !vis.count({i.f, i.s + 1})) q.push({i.f, i.s + 1}), vis.insert({i.f, i.s + 1});
if (i.f > 1 && !vis.count({i.f - 1, i.s})) q.push({i.f - 1, i.s}), vis.insert({i.f - 1, i.s});
}
return 0;
}
