#include<bits/stdc++.h>
using namespace std;
int const N = 1005;
int a[N], b[N], ans[N];
vector<int> have[33];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
        have[a[i]].push_back(i);
    }
    priority_queue<pair<int, int> , vector<pair<int, int> >, greater<pair<int, int> > > pq;
    for(int i = 1; i <= 31; i++){
        for(auto j : have[i]){
            pq.push({b[j], j});
        }
        for(int j = 0; j < k && !pq.empty(); j++){
            ans[pq.top().second] = i;
            pq.pop();
        }
    }
    for(int i = 1; i <= n; i++){
        cout << ans[i] << '\n';
    }

}