/*
                ____________    ______________       __
               / _________  /\ /_____   _____/\     / /\
              / /\       / /  \\    /  /\    \ \   / /  \
             / /  \_____/ /   / \__/  /  \____\/  / /   /
            / /   /    / /   /    /  /   /       / /   /
           / /   /    / /   /    /  /   /       / /   /
          / /   /    / /   /    /  /   /       / /   /
         / /___/____/ /   /    /  /   /       / /___/________
        /____________/   /    /__/   /       /______________/\
        \            \  /     \  \  /        \              \ \
         \____________\/       \__\/          \______________\/
           ___       ___               ___    __________
          /  /\     /  /\             /  /\  /_______  /\
         /  /__\___/  /  \           /  /  \ \      /  /  \
        /____    ____/   /          /  /   /  \____/  /   /
        \   /   /\   \  /          /  /   /       /  /   /
         \_/   /  \___\/ ___      /  /   /       /  /   /
          /   /   /     /  /\    /  /   /       /  /   /
         /   /   /     /  /__\__/  /   /       /  /___/____
        /___/   /     /___________/   /       /___________/\
        \   \  /      \           \  /        \           \ \
         \___\/        \___________\/          \___________\/

          A FAN OF FIZZYDAVID

*/

#include<bits/stdc++.h>

#define HEAP priority_queue
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define forn(i,l,r) for(int i=(l);i<=(r);i++)
#define nrof(i,r,l) for(int i=(r);i>=(l);i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-6
#define pi 3.1415926535897932384626433832795
#define orz int
#define yjz main
#define fizzydavid return
#define ak 0
#define la ;
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define FILL(a,b) memset((a),(b),sizeof((a)))

using namespace std;

typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<LL> vl;
typedef pair<int,LL> pil;
typedef pair<LL,int> pli;
typedef pair<LL,LL> pll;
typedef vector<pil> vil;
typedef vector<pii> vii;

const int iinf=1e9+7;
const LL linf=1ll<<60;
const flt dinf=1e10;

template <typename T>
inline void scf(T &x)
{
	bool f=0; x=0; char c=getchar();
	while((c<'0' || c>'9') && c!='-') c=getchar();
	if(c=='-') { f=1; c=getchar(); }
	while(c>='0' && c<='9') { x=x*10+c-'0'; c=getchar(); }
	if(f) x=-x; return;
}

template <typename T1,typename T2>
void scf(T1 &x,T2 &y) { scf(x); return scf(y); }

template <typename T1,typename T2,typename T3>
void scf(T1 &x,T2 &y,T3 &z) { scf(x); scf(y); return scf(z); }

template <typename T1,typename T2,typename T3,typename T4>
void scf(T1 &x,T2 &y,T3 &z,T4 &w) { scf(x); scf(y); scf(z); return scf(w); }

#ifdef ONLINE_JUDGE
#define debug(x,c) ;
#else
#define DEBUG
#define debug(x,c) cerr<<#x<<"="<<x<<c;
#endif

//---------------------------head----------------------------

const int N = 3e5 + 100;

int n,m;
pii all[N];
int ans[N];
set<pii> has;
vi d[N];

namespace BIT
{
    int num[N];
    inline int lowbit(const int &i){ return i & (-i); }
    inline void modify(int i,const int &x)
    {
        for(; i <= m; i += lowbit(i)) num[i] += x;
        return;
    }
    inline int query(int i)
    {
        int ret = 0;
        for(; i ; i ^= lowbit(i)) ret += num[i];
        return ret;
    }
}

inline void get_fac(int n)
{
//    debug(n,'\n')
    for(int i = 1; i * i <= n; ++i) if(n % i == 0)
    {
        d[n].pb(i);
        if(i * i != n) d[n].pb(n / i);
    }
    return;
}

inline void add(const int &i)
{
    #ifdef DEBUG
//    cout<<"add:\t"<<i<<endl;
    #endif // DEBUG
    int &l = all[i].X, &r = all[i].Y;
    return BIT::modify(l,1);
}

inline void del(const int &i)
{
    #ifdef DEBUG
//    cout<<"del:\t"<<i<<endl;
    #endif // DEBUG
    int &l = all[i].X, &r = all[i].Y;
    return BIT::modify(l,-1);
}

orz yjz()
{
    scf(n,m);
    rep(i,n)
    {
        int l,r; scf(l,r);
        all[i] = mp(l,r);
    }
    sort(all, all + n);
    forn(i,1,m) get_fac(i);
    int I = 0;
    forn(i,1,m)
    {
        while(I < n && all[I].X <= i) add(I), has.insert({all[I].Y,I}), I++;
        while(SZ(has) && has.begin() -> X < i) del(has.begin() -> Y), has.erase(has.begin());
        for(auto j : d[i])
        {
//            debug(i,' ') debug(j,'\n')
            ans[j] += BIT::query(i) - BIT::query(i - j);
        }
    }
    forn(i,1,m) printf("%d\n",ans[i]);
	fizzydavid ak la
}


Measured memory_bytes: 32000