// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 3e5 + 5;

int N, M;
Pii A[MAXN];

void input()
{
    read(N); read(M);
    for (int i = 1; i <= N; ++i) {
        read(A[i].x); read(A[i].y);
    }
}

namespace BIT
{

const int SIZE = 3e5 + 5;

int s[MAXN];

void add(int p, int x)
{
    for (++p; p <= M + 1; p += p & -p) {
        s[p] += x;
    }
}

int sum(int p)
{
    int ret = 0;
    for (++p; p; p -= p & -p) {
        ret += s[p];
    }
    return ret;
}

}

void solve()
{
    static int sufcnt[MAXN];

    for (int i = 1; i <= N; ++i) {
        ++sufcnt[A[i].y - A[i].x + 1];
    }
    for (int i = M; i >= 1; --i) {
        sufcnt[i - 1] += sufcnt[i];
    }

    std::sort(A + 1, A + N + 1, [](const Pii &a, const Pii &b){ return a.y - a.x < b.y - b.x; });
    for (int i = 1, p = 1; i <= M; ++i) {
        for (; p <= N && A[p].y - A[p].x + 1 <= i; ++p) {
            BIT::add(A[p].x, +1);
            BIT::add(A[p].y + 1, -1);
        }
        int ans = sufcnt[i + 1];
        for (int j = 0; j <= M; j += i) {
            ans += BIT::sum(j);
        }
        printf("%d\n", ans);
    }
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();
}

// 绿树村边合，青山郭外斜。
//     -- 孟浩然《过故人庄》


Measured memory_bytes: 4224