#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define len(s) (ll) s.size()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 5;
const int MAX = 2e4 + 11;
const int P = 31;
const int mod = 1e9 + 7;
const ll inf = 1e18;
ll n, k;
ll x[N], y[N];
void solve(){
cin >> n >> k;
for(ll i = 1; i <= n; i++) cin >> x[i] >> y[i];
vector < ll > ans;
for(ll i = 1; i <= n; i++){
for(ll j = i + 1; j <= n; j++){
ans.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
}
}
sort(all(ans));
for(ll x : ans){
cout << x << '\n';
k--;
if(k == 0) exit(0);
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tt = 1;
// cin >> tt;
while(tt--) solve();
}
