#pragma GCC optimizer("Ofast")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define int long long 
#define ld long double
#define ull unsigned long long 
#define fr first
#define fi first
#define sc second
#define se second
#define all(x) x.begin(), x.end()
#define pii pair<int,int>
using namespace std;

#ifndef fireball
#define tofu ios::sync_with_stdio(0); cin.tie(0);
#else
#define tofu freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif 

void db() {cout << '\n';}
template <typename T, typename ...U> void db(T a, U ...b) {cout << a << ' ', db(b...);}

struct task{
    int l, r, id;
    bool operator < (const task &other){
        return r < other.r;
    }
};

signed main(){
    tofu;
    int n, k;
    cin >> n >> k;
    task a[n];
    int ans[n] = {};
    for(int i = 0; i < n; ++i){
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
    }
    sort(a, a + n, [&](task x, task y){
        return x.l < y.l;
    });

    priority_queue<pii, vector<pii>, greater<pii> > q;
    int now = 0;
    for(int d = 1; d <= 31; ++d){
        while(now < n and a[now].l <= d) q.push({a[now].r, now++});
        int cnt = 0;
        while(cnt < k and !q.empty()){
            cnt++;
            int u = q.top().sc;
            q.pop();
            ans[a[u].id] = d;
        }
    }

    for(int i = 0; i < n; ++i) db(ans[i]);
}