#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n;i>=1;--i)
#define pb push_back
#define mp make_pair
#define stack stck 
#define N 1100
#define M 510000
#define inf 1000000007
struct EDGE { int adj, w, next; } edge[M];
int top, gh[N], nrl[N],S,T;
void addedge(int x, int y, int w) {
    edge[++top].adj = y;
    edge[top].w = w;
    edge[top].next = gh[x];
    gh[x] = top;
    edge[++top].adj = x;
    edge[top].w = 0;
    edge[top].next = gh[y];
    gh[y] = top;
}
int dist[N], q[N];
int bfs() {
    memset(dist, 0, sizeof(dist)); 
    q[1] = S; int head = 0, tail = 1; dist[S] = 1;
    while (head != tail) {
        int x = q[++head];
        for (int p=gh[x]; p; p=edge[p].next)
            if (edge[p].w && !dist[edge[p].adj]) {
                dist[edge[p].adj] = dist[x] + 1;
                q[++tail] = edge[p].adj;
            }
    }
    return dist[T];
}
int dinic(int x, int delta) {
    if (x==T) return delta;
    for (int& p=nrl[x]; p && delta; p=edge[p].next)
        if (edge[p].w && dist[x]+1 == dist[edge[p].adj]) {
            int dd = dinic(edge[p].adj, min(delta, edge[p].w));
            if (!dd) continue;
            edge[p].w -= dd;
            edge[p^1].w += dd;
            return dd;
        }
    return 0;
}
int work() {
    int ans = 0;
    while (bfs()) {
        memcpy(nrl, gh, sizeof(gh));
        int t; while (t = dinic(S, inf)) ans += t;
    }
    return ans;
}
int id[1010][35],n,k,l[1010],r[1010];
int main()
{	
	cin>>n>>k;
	top=1;
	S=0; T=n+31+1;
	rep(i,n)addedge(S,i,1);
	rep(i,31)addedge(n+i,T,k);
	rep(i,n)
	{
		scanf("%d%d",&l[i],&r[i]);
		for(int j=l[i];j<=r[i];j++)
		{
			id[i][j]=top+1;
			addedge(i,n+j,1);
		}
	}
	work();
	rep(i,n)
	{
		for(int j=l[i];j<=r[i];j++)
			if (edge[id[i][j]].w==0)
			{
				printf("%d\n",j);
				break;
			}
	}
	return 0;
}