#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, x, y;
pii a[MN];
int cost(pii p, pii q) {
return max(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 >> x >> y;
a[i] = {x + y, x - y};
}
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;
}
