#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
int n, k;
pll a[N];
vector<ll> ans;
ll getDist(int i, int j) {
return max(abs(a[i].fi - a[j].fi), abs(a[i].se - a[j].se));
}
int count(ll maxDist) {
// xj < xi, yj < yi -> xi + yi - (xj + yj) <= maxDist
// xj < xi, yj > yi -> xi - yi - (xj - yj) <= maxDist
set<pli> s; ans.clear();
for (int i = 1, j = 1; i <= n; ++i) {
while (!s.empty() && a[i].fi - a[j].fi > maxDist) {
s.erase(make_pair(a[j].se, j));
++j;
}
// cerr << j << ' ' << i << ' ' << a[i].fi << ' ' << a[j].se << ' ' << maxDist << '\n';
// abs(a[i].se - it->fi) <= maxDist
// a[i].se - maxDist <= it->fi <= a[i].se + maxDist
auto it = s.upper_bound(make_pair(a[i].se - maxDist, -inf));
while (it != s.end() && ans.size() < k && it->fi <= a[i].se + maxDist) {
ans.emplace_back(getDist(i, it->se));
// cerr << i << ' ' << it->se << '\n';
it = next(it);
}
s.emplace(a[i].se, i);
}
return ans.size();
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int x, y; cin >> x >> y;
a[i] = make_pair(x + y, x - y);
}
sort (a + 1, a + 1 + n);
ll low = 0, high = 1e10, d = -1;
while (low <= high) {
ll mid = (low + high) >> 1;
if (count(mid) < k) low = (d = mid) + 1;
else high = mid - 1;
}
// cerr << d << '\n';
// ll d = 3;
count(d);
while (ans.size() < k) ans.emplace_back(d + 1);
sort (ans.begin(), ans.end());
for (auto &x : ans) cout << x << '\n';
return 0;
}
