#include <bits/stdc++.h>

#define maxn 100005

using namespace std;

int fa[maxn];
int find(int x) {
	return fa[x] == x ? x : (fa[x] = find(fa[x]));
}
void merge(int x, int y){
	fa[find(x)] = find(y);
}

int n, k;
int t[maxn];
struct node{
	int l, r, id;
};
node a[maxn];
int ans[maxn];

int main() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d%d", &a[i].l, &a[i].r);
		a[i].id = i;
	}
	for (int i = 1; i <= 50; i++) fa[i] = i;
	sort(a + 1, a + n + 1, [&](node a, node b) {return a.r < b.r;});
	for (int i = 1; i <= n; i++) {
		int tmp = (ans[a[i].id] = find(a[i].l));
		if (++t[tmp] == k) merge(tmp, tmp + 1);
	}
	for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
	return 0;
}