#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,k;cin >> n >> k;
vector<long long> X(n);
vector<long long> Y(n);
vector<pair<long long,long long>> points(n);
vector<pair<long long,long long>> points2(n);
for(int i = 0;i<n;i++){
cin >> X[i];cin >> Y[i];
points[i].first = X[i];
points[i].second = Y[i];
points2[i].first = Y[i];
points2[i].second = X[i];
}
//obviously I can't construct all possible pairs of roads
//as that will tle
sort(points.begin(),points.end());
sort(points2.begin(),points2.end());
//Subtask 1 : N <= 1000;
//ok grabbed subtask 1
//subtask 3, k = 1
//subatsk 4 : k <= 10, basically the same as subtask 3 but a larger range
vector<long long> dist;
for(int i = 0;i<n;i++){
long long x = points[i].first;
long long y = points[i].second;
long long n1 = LLONG_MAX;
long long n2 = LLONG_MAX;
long long left = max(0LL,i-k);
long long right = min(n-1,i+k);
for(int j = i-1;j>= left;j--){
if (j != i){
n1 = abs(x - points[j].first) + abs(y-points[j].second);
dist.push_back(n1);
}
}
for(int j = i+1;j<=right;j++){
n2 = abs(x - points[j].first) + abs(y - points[j].second);
dist.push_back(n2);
}
}
for(int i = 0;i<n;i++){
long long y = points2[i].first;
long long x = points2[i].second;
long long n1 = LLONG_MAX;
long long n2 = LLONG_MAX;
long long left = max(0LL,i-k);
long long right = min(n-1,i+k);
for(int j = i-1;j>= left;j--){
if (j != i){
n1 = abs(y - points[j].first) + abs(x-points[j].second);
dist.push_back(n1);
}
}
for(int j = i+1;j<=right;j++){
n2 = abs(y - points[j].first) + abs(x - points[j].second);
dist.push_back(n2);
}
}
sort(dist.begin(),dist.end());
for(int i = 0;i<k;i++){
cout << dist[i] << '\n';
}
}
