#include <bits/stdc++.h>
#define all(a) sort(a.begin(), a.end())
#define allr(a) reverse(a.begin(), a.end())
#define rall(a) sort(a.rbegin(), a.rend())
#define ll long long
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define mk make_pair
using namespace std;
const ll N = 1e8 + 55;
ll x[N], y[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, K;
cin >> n >> K;
for(ll i = 0; i < n; i++){
cin >> x[i] >> y[i];
}
ll cost = 0;
for(ll i = 1; i <= n; i++){
for(ll j = 0; j < n; j++){
cost = abs(x[i] - x[j]) + abs(y[i] + y[j]);
for(ll k = 0; k < K; k++){
cout << min(K, cost) << '\n';
}
return 0;
}
}
}
