#include<bits/stdc++.h>
#include<bits/extc++.h>
 
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define mem(x,i) memset((x),(i),sizeof((x)))
 
using namespace std;
//using namespace __gnu_pbds;
using pii = pair<long long,long long>;
using ld = long double;
using ll = long long;
 
mt19937 mtrd(chrono::steady_clock::now().time_since_epoch().count());
 
const int mod = 1000000007;
const int mod2 = 998244353;
const ld PI = acos(-1);
 
#define Bint __int128
#define int long long

namespace DEBUG{ 
	template <typename T, typename T2>
	ostream& operator<<(ostream& os, const pair<T, T2>& pr) {
		os << "( " << pr.first << ", " << pr.second << ")";
		return os;
	}

	template <typename T>
	inline void printv(T l, T r){
		cerr << "DEBUG: [ ";
		for(; l != r; l++)
			cerr << *l << ", ";
		cerr << "]" << endl;
	}
	
	template <typename T>
	inline void _debug(const char* format, T t) {
		cerr << format << '=' << t << endl;
	}
	
	template <class First, class... Rest>
	inline void _debug(const char* format, First first, Rest... rest) {
		while (*format != ',')
			cerr << *format++;
		cerr << '=' << first << ",";
		_debug(format + 1, rest...);
	}

	#define TEST
	#ifdef TEST
	#define debug(...) cerr << "DEBUG: ",_debug(#__VA_ARGS__, __VA_ARGS__)
	#else
	#define debug(...) void(0)
	#define printv(...) void(0)
	#endif
}  // namespace DEBUG

using namespace DEBUG;

/* ----------------------------------------  */
const int N = 1010;

struct house{
	int l, r, id;	
};

int n, k;
int ans[N];
house a[N];

void solve(){
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> a[i].l >> a[i].r;
		a[i].id = i;
	}
	sort(a, a + n, [](house x, house y){
		return x.l < y.l;	
	});
	int p = 0;
	priority_queue<pii, vector<pii>, greater<pii>>pq;
	for(int i = 1; i <= 31; i++){
		while(p < n && a[p].l <= i){
			pq.push(mp(a[p].r, a[p].id));	
			p++;
		}
		int cur = k;
		while(!pq.empty() && cur){
			auto [r, id] = pq.top();
			if(r < i)
				break;
			ans[id] = i;
			cur--;
			pq.pop();
		}
	}
	for(int i = 0; i < n; i++)
		cout << ans[i] << '\n';
}
 
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t = 1; 
	// cin >> t;
	while(t--)
		solve();
}