#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
#pragma GCC target("avx2")  //Enable AVX

using namespace std;

using ll = long long;

#define mp make_pair

const int p = 1000000007;


int mul(int a, int b) {
    return (1LL * a * b) % p;
}

int add(int a, int b) {
    int s = (a+b);
    if (s>=p) s-=p;
    return s;
}

int sub(int a, int b) {
    int s = (a+p-b);
    if (s>=p) s-=p;
    return s;
}

int po(int a, int deg)
{
    if (deg==0) return 1;
    if (deg%2==1) return mul(a, po(a, deg-1));
    int t = po(a, deg/2);
    return mul(t, t);
}

int inv(int n)
{
    return po(n, p-2);
}

/*struct DSU {
    vector<int> sz;
    vector<int> parent;

    void make_set(int v) {
        parent[v] = v;
        sz[v] = 1;
    }

    int find_set(int v) {
        if (v == parent[v])
            return v;
        return parent[v] = find_set(parent[v]);
    }

    void union_sets(int a, int b) {
        a = find_set(a);
        b = find_set(b);
        if (a != b) {
            if (sz[a] < sz[b])
                swap(a, b);
            parent[b] = a;
            sz[a] += sz[b];
        }
    }

    DSU(int n) {
        sz.resize(n);
        parent.resize(n);
        for (int i = 0; i < n; i++) make_set(i);
    }
};*/

/*const int N = 1000000;

vector<int> facs(N), invfacs(N);

void init()
{
    facs[0] = 1;
    for (int i = 1; i<N; i++) facs[i] = mul(facs[i-1], i);
    invfacs[N-1] = inv(facs[N-1]);
    for (int i = N-2; i>=0; i--) invfacs[i] = mul(invfacs[i+1], i+1);
}

int C(int n, int k)
{
    return mul(facs[n], mul(invfacs[k], invfacs[n-k]));
}*/

const int N = 100005;

vector<vector<int>> changers(N);

void init()
{
    for (int i = 1; i<N; i++)
    {
        int t = 2*sqrt(i);
        for (int c = 1; c<=t; c++) changers[i].push_back(c);
        for (int c = t; c>=1; c--) if ((i/c) + 1>changers[i].back()) changers[i].push_back((i/c) + 1);
    }
}



int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);

    init();

    int n, m;
    cin>>n>>m;
    vector<int> l(n);
    vector<int> r(n);
    for (int i = 0; i<n; i++)
    {
        cin>>l[i]; l[i]--; cin>>r[i];
    }

    vector<vector<int>> L_change(m+1), R_change(m+1);

    /*for (int i = 1; i<10; i++)
    {
        for (auto it: changers[i]) cout<<it<<' ';
        cout<<endl;
    }*/

    for (int i = 0; i<n; i++) for (auto it: changers[l[i]]) if (it<=m) L_change[it].push_back(i);
    for (int i = 0; i<n; i++) for (auto it: changers[r[i]]) if (it<=m) R_change[it].push_back(i);

    /*for (int i = 1; i<=m; i++)
    {
        for (auto it: L_change[i]) cout<<it<<' ';
        cout<<endl;
        for (auto it: R_change[i]) cout<<it<<' ';
        cout<<endl;
    }

    cout<<">>>\n";
    for (int i = 0; i<n; i++) cout<<l[i]<<' '<<r[i]<<endl;*/

    vector<int> answer(m+1);
    answer[1] = n;
    for (int i = 2; i<=m; i++)
    {
        //cout<<i<<":"<<endl;
        answer[i] = answer[i-1];
        //cout<<"L:"<<endl;
        for (auto it: L_change[i])
        {
            if (l[it]/i != r[it]/(i-1) && l[it]/(i-1) == r[it]/(i-1)) answer[i]++;
            //cout<<it<<' '<<answer[i]<<endl;
        }
        //cout<<"R:"<<endl;
        for (auto it: R_change[i])
        {
            if (l[it]/i != r[it]/(i-1) && l[it]/i == r[it]/i) answer[i]--;
            //cout<<it<<' '<<answer[i]<<endl;
        }
    }

    for (int i = 1; i<=m; i++) cout<<answer[i]<<endl;
}