#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);
for(int i = 0;i<n;i++){
cin >> X[i];cin >> Y[i];
points[i].first = X[i];
points[i].second = Y[i];
}
//obviously I can't construct all possible pairs of roads
//as that will tle
sort(points.begin(),points.end());
//Subtask 1 : N <= 1000;
//I can find the distance to all points
vector<long long> dist;
for(int i = 0;i<n;i++){
long long x = points[i].first;
long long y = points[i].second;
for(int j = i + 1;j<n;j++){
long long sum = abs(points[j].first - x) + abs(points[j].second - y);
dist.push_back(sum);
}
}
sort(dist.begin(),dist.end());
for(int i = 0;i<k;i++){
cout << dist[i] << '\n';
}
}
