#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k; cin >> n >> k;
    using P = pair<int,int>;
    vector<pair<P,int>> v(n);
    for (int i = 0; i < n; ++i) {
        int a,b; cin >> a >> b;
        v[i].first = {a,b};
        v[i].second = i;
    }
    vector<int> res(n,-1);
    priority_queue<P,vector<P>,greater<P>> pq;
    for (int i = 1; i <= 31; ++i) {
        for (int j = 0; j < n; ++j) {
            // siten zyoken mitasitara ireru
            if(i == v[j].first.first){
                pq.push({v[j].first.second,v[j].second});
            }
        }
        for (int l = 0; l < k; ++l) {
            if(pq.size()){
                auto p = pq.top(); pq.pop();
                res[p.second] = i;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << res[i] << "\n";
    }
}