#pragma GCC optimize("Ofast,unroll-loops,inline")
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=2e5+5;
const int mod=1e9+7;
const int base=311;
ll n,k,a[maxN],b[maxN],res[maxN];
void Enter(){
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
    priority_queue<pll,vector<pll>,greater<pll>> pq;
    for(int j=1;j<=31;j++){
        for(int i=1;i<=n;i++)if(a[i]==j)pq.push({b[i],i});
        for(int i=0;i<k&&pq.size();i++){
            res[pq.top().second]=j;
            pq.pop();
        }
    }
    for(int i=1;i<=n;i++)cout<<res[i]<<endl;
}
//amogus
signed main(){
    //open("tbrackets");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //int t=1;cin>>t;while(t--)
    Enter();
}