#include <bits/stdc++.h>
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
using namespace std;
const int N = 3e5 + 123;
const int inf = 1e18;
const int mod = 1e9 + 7;
const double eps = 1e-13;
int n, m, k, z, x[N], y[N], rx[N], ry[N], nashel, ans;
vector <int> answ;
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
int rand( int l, int r )
{
uniform_int_distribution <int> uid( l, r );
return uid( rng );
}
vector <int> ordx;
bool cmp( int a, int b ) { return x[a] < x[b]; }
multiset <int> st;
int dist( int a, int b )
{
return abs(x[a] - x[b]) + abs(y[a] - y[b]);
}
void change( int dis )
{
if( *st.rbegin() > dis )
{
st.erase( st.find(*st.rbegin()) );
st.ins(dis);
}
}
void solve()
{
cin >> n >> k;
vector <int> v;
FOR( i, 1, n, 1 )
{
cin >> x[i] >> y[i];
ordx.pb(i);
}
sort( all(ordx), cmp );
FOR( i, 0, n - 1, 1 )
{
FOR( j, i + 1, min( n - 1, i + 5000 ), 1 )
{
if( sz(st) < k ) st.ins(dist(ordx[i], ordx[j]));
else change( dist(ordx[i], ordx[j]) );
}
}
for( auto i : st ) cout << i << '\n';
}
signed main()
{
// freopen("connect.in", "r", stdin);
// freopen("connect.out", "w", stdout);
respagold
int test = 1;
if( !test ) cin >> test;
while( test -- )
{
solve();
}
}
// solved by KluydQ
