#include <bits/stdc++.h>
const int N = 2e5 + 10;
int n, m, res[N];
struct so{
    int id, l, r;
}s[2 * N];
bool cmp(so a, so b){
    return a.l < b.l;
}
int f[2 * N][20];
void init(){
    for(int i = 1, p = i;i <= 2 * n;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];
            }
        } 
    } 
}
void query(int x){
    int li = s[x].l + m, ans = 1, p = x;
    for(int i = 19;i >= 0;i--){
        if(f[x][i] && s[f[x][i]].r < li){
            ans += (1 << i);
            x = f[x][i];
        }
    }
    res[s[p].id] = ans;
}
using namespace std;
int main(){
    freopen("flagplan.in", "r", stdin);
    freopen("flagplan.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        cin >> s[i].l >> s[i].r;
        if(s[i].r < s[i].l) 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;
    } 
    init();
    for(int i = 1;i <= n;i++){
        query(i);
    }
    for(int i = 1;i <= n;i++){
        cout<<res[i] + 1<<' ';
    }
    cout<<endl;
}