#include<bits/stdc++.h>
using namespace std;
int n,m,ans[200001];
struct node {
	int id,l,r;
}s[400002];
int f[400002][20];
inline int read() {
	int x = 0, w = 1;char ch = getchar();
	while (ch > '9' || ch < '0') { if (ch == '-')w = -1;ch = getchar(); }
	while (ch >= '0' && ch <= '9')x = x * 10 + ch - '0', ch = getchar();
	return x * w;
}
bool cmp(node a,node b){
	return a.l<b.l;
}
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		s[i].l=read();s[i].r=read();
		if(s[i].l>s[i].r){
			s[i].r+=m;
		}
		s[i].id=i;
	}
	sort(s+1,s+n+1,cmp);
	for(int i=1;i<=n;i++){
	//	s[i+n]=s[i];
		s[i+n].l=s[i].l+m;
		s[i+n].r=s[i].r+m;
	}
	for(int i=1;i<=2*n;i++){
		int p=i;
		while(p<=2*n&&s[p].l<=s[i].r){
			p++;
		}
		f[i][0]=p-1;
	}
	for(int i=1;i<20;i++){
		for(int j=1;j<=2*n;j++){
			f[j][i]=f[f[j][i-1]][i-1];
		}
	}
	int sum,k;
	for(int i=1;i<=n;i++){
		k=i;sum=0;int lm=s[k].l+m;
		for(int j=19;j>=0;j--){
			if(s[f[k][j]].r==lm){
				sum+=(1<<j)-1;	
				break;
			}
			if(f[k][j]!=0&&s[f[k][j]].r<lm){
				k=f[k][j];
				sum+=(1<<j);
			}
		}	
		ans[s[i].id]=sum+2;
	}
	for(int i=1;i<=n;i++){
		printf("%d ",ans[i]);
	}	return 0;
}

rt