#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 400005;
const int lim = 21;
struct seg{
    int l, r, id;
}s[maxn];
int n, m;
int lg[maxn], mi[maxn], ans[maxn], nxt[maxn];
int f[maxn][lim];
bool cmp (seg x, seg y)
{
    return x.l < y.l;
}
void deal ()
{
    mi[0] = 1;
    for (int i = 1; i < lim; ++i)  mi[i] = mi[i - 1] << 1;
    for (int i = 1; i <= n; ++i)    f[i][0] = i;
    for (int p = 2, i = 1; i <= n; ++i) {
        while (p < n && s[p + 1].l <= s[i].r)    ++p;
        nxt[i] = p;
    }
    for (int i = 1; i <= lg[n]; ++i)
        for (int j = 1; j <= n; ++j) {
            if (n - j + 1 >= mi[i]) f[j][i] = f[nxt[f[j][i - 1]]][i - 1];//只需求前面n条线段的答案，因此第2n条线段是不可能被用上的，若f[j][i]被赋值为0就说明不需要用这么多线段就可以覆盖环了
            else break;
        }
}
int query (int x)
{
    int res = 0, lt = s[x].l;
    for (int i = lg[n - x + 1]; ~i; --i)
        if (f[x][i] && s[f[x][i]].r - lt + 1 <= m)//f[x][i]为0说明不需要跳这么远
            res += mi[i], x = nxt[f[x][i]];
    return res + 1;
}
int main ()
{
    scanf("%d%d", &n, &m);
    lg[0] = -1;
    for (int i = 1; i <= n; ++i) {
		scanf("%d%d", &s[i].l, &s[i].r);
        if (s[i].r < s[i].l)    s[i].r += m;
	}
    for (int i = 1; i <= n; ++i) {
        s[i + n].l = s[i].l + m;
        s[i + n].r = s[i].r + m;
	}
    n <<= 1;
    for (int i = 1; i <= n; ++i)    s[i].id = i, lg[i] = lg[i >> 1] + 1;
    sort(s + 1, s + n + 1, cmp);
    deal();
    for (int i = 1; i <= n / 2; ++i)
        ans[s[i].id] = query(i);
    n >>= 1;
    for (int i = 1; i <= n; ++i)    printf("%d ", ans[i]);
    return 0;
}