#include "bits/stdc++.h"
using namespace std;
using ll     = long long;
using pii    = pair<int, int>;
using pll    = pair<ll, ll>;
using vi     = vector<int>;
using vl     = vector<ll>;
using vvi    = vector<vi>;
using vvl    = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
    std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
    os << std::endl;
}

template <typename T = ll>
struct SegmentTreeLazyAdd {
  private:
    using F = function<T(T, T)>;
    int n;
    vector<T> node, lazy;
    vector<bool> lazyFlag;
    F func;
    T UNIT;

  public:
    SegmentTreeLazyAdd(int sz, F func, T UNIT) : func(func), UNIT(UNIT) {
        n = 1;
        while (n < sz)
            n *= 2;
        node.assign(2 * n - 1, UNIT);
        lazy.assign(2 * n - 1, UNIT);
        lazyFlag.resize(2 * n - 1, false);
    }
    SegmentTreeLazyAdd(vector<T> v, F func, T UNIT) : func(func), UNIT(UNIT) {
        int sz = int(v.size());
        n      = 1;
        while (n < sz)
            n *= 2;
        node.resize(2 * n - 1, UNIT);
        lazy.resize(2 * n - 1, UNIT);
        lazyFlag.resize(2 * n - 1, false);

        for (int i = 0; i < sz; i++)
            node[i + n - 1] = v[i];
        for (int i = n - 2; i >= 0; i--)
            node[i] = func(node[i * 2 + 1], node[i * 2 + 2]);
    }
    void lazyEvaluate(int k, int l, int r) {
        if (lazyFlag[k]) {
            node[k] += lazy[k];
            if (r - l > 1) {
                lazy[k * 2 + 1] += lazy[k];
                lazy[k * 2 + 2] += lazy[k];
                lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
            }
            lazyFlag[k] = false;
            lazy[k]     = 0;
        }
    }
    // add x to nodes in [a, b)
    void add(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
        if (r < 0)
            r = n;
        lazyEvaluate(k, l, r);
        if (b <= l || r <= a) {
            return;
        }
        if (a <= l && r <= b) {
            lazy[k] += x; // +=
            lazyFlag[k] = true;
            lazyEvaluate(k, l, r);
            return;
        } else {
            const int mid = (l + r) / 2;
            add(a, b, x, k * 2 + 1, l, mid);
            add(a, b, x, k * 2 + 2, mid, r);
            node[k] = func(node[2 * k + 1], node[2 * k + 2]);
        }
    }
    // get func() in [a, b)
    T query(int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)
            r = n;
        lazyEvaluate(k, l, r);
        if (b <= l || r <= a)
            return UNIT;
        if (a <= l && r <= b)
            return node[k];
        T vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
        T vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
        return func(vl, vr);
    }
};

int main() {
    int n, m;
    cin >> n >> m;
    struct sec {
        int lr, l, r;
        bool operator<(const sec &rhs) const { return lr < rhs.lr; };
    };
    deque<sec> lr;
    for (int i = 0; i < n; ++i) {
        int l, r;
        cin >> l >> r;
        lr.push_back({r - l + 1, l, r});
    }
    sort(lr.begin(), lr.end());
    int cnt = n;
    auto f  = [](int l, int r) { return l + r; };
    SegmentTreeLazyAdd<int> sg(m + 2, f, 0);
    for (int i = 1; i <= m; ++i) {
        while (!lr.empty() && lr.front().lr <= i - 1) {
            auto f = lr.front();
            lr.pop_front();
            sg.add(f.l, f.r + 1, 1);
            cnt--;
        }
        int ret = cnt;
        for (int j = 0; j <= m; j += i) {
            ret += sg.query(j, j + 1);
        }
        cout << ret << "\n";
    }

    return 0;
}

Measured memory_bytes: 8064