/*
 * author: weiyutang
 */

#include <bits/stdc++.h>
using namespace std;

/* ===== BEGIN USER CODE ===== */

#define ll long long
#define ld long double
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9 + 7;
const vector<vector<int>> dirs4 {{0,1}, {1,0}, {-1,0}, {0,-1}};
const vector<vector<int>> dirs8 {{0,1}, {1,0}, {-1,0}, {0,-1}, {-1,-1}, {-1,1}, {1,-1}, {1,1}};

void solve() {
	int n, k;
	cin >> n >> k;

	vector<array<int, 3>> v(n); // id
	for (int i = 0; i < n; i++) {
		v[i][0] = i;
		cin >> v[i][1] >> v[i][2];
	}

	map<int, vector<int>> mp; // {day: [houses]}
	vector<int> ans(n); // house -> day
	sort(v.begin(), v.end(), [&] (auto& a, auto& b) {
		if (a[2] == b[2])
			return a[1] < b[1];
		return a[2] < b[2];
	});

	// for (auto& x: v) cout << x[0] << " " << x[1] << " " << x[2] << endl;

	for (int i = 0; i < n; i++) {
		for (int day = v[i][1]; day <= v[i][2]; day++) {
			if (mp[day].size() < k) {
				mp[day].push_back(v[i][0]);
				break;
			}
		}
	}

	for (auto& x: mp) {
		for (auto& y: x.s) {
			ans[y] = x.f;
		}
	}

	for (int& x: ans) {
		cout << x << endl;
	}

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(chrono::steady_clock::now().time_since_epoch().count());

    int t = 1;
    // cin >> t;

    while (t--) {
		solve();
	}

    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl; 
    return 0;
}