#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;

#if !ONLINE_JUDGE
#define debug
#endif

using namespace std;
 
/*******  All Required define Pre-Processors and typedef Constants *******/
#define mem(a, b) memset(a, (b), sizeof(a))
#define repd(i,k) for(int i=k;i>=0;i--)
#define rep(i,k) for(int i=0;i<k;i++)
#define repn(i,k1,k2) for(ll i=k1;i<k2;i++)
#define sz(x) (ll)(x).size()
#define ff first
#define ss second

#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ee6 (ll)1000001
#define ee5 (ll)100001

#define trav(a, v) for(auto& a : v)

#define tt ll t;cin>>t; while(t--)
typedef long long int ll;
 
typedef pair<ll, ll> pr;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pr> vpr;
typedef vector<vpr>vvpr;
typedef vector<vi> vvi;

//*X.find_by_order(2) element at index=2
//X.order_of_key(1) how many elements strictly less than 1

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;

#ifdef debug
#define dbg(...) { cerr<<"[ "; dump(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.ff<<","<<x.ss<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const unordered_map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
} 
 
template <typename Arg1>
void dump(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void dump(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    dump(names.substr(1+(int)name.size()), args...);
}
#else
    #define dbg(args...)
#endif
 
ll powmod(ll x, ll y) 
{ 
    ll res = 1;  
    x = x % MOD;
    while (y > 0) 
    { 
        if (y & 1) 
            res = (res*x) % MOD; 
        y = y>>1; // y = y/2 
        x = (x*x) % MOD;   
    } 
    return res; 
} 
vector<int>x[ee5];
vector<int> seg[4*ee5];

void build(int low,int high,int index){
    if(low==high){
        seg[index]=x[low];
        sort(all(seg[index]));
        return;
    }
    int mid=(low+high)/2;
    build(low,mid,index*2+1);
    build(mid+1,high,index*2+2);
    int l1=0,r1=seg[index*2+1].size();
    int l2=0,r2=seg[index*2+2].size();
    while(l1<r1 and l2<r2){
        if(seg[index*2+1][l1]<seg[index*2+2][l2]){
            seg[index].pb(seg[index*2+1][l1++]);
        }
        else 
            seg[index].pb(seg[index*2+2][l2++]);
    }
    while(l1<r1){
        seg[index].pb(seg[index*2+1][l1++]);
    }
    while(l2<r2){
        seg[index].pb(seg[index*2+2][l2++]);
    }
}

int query(int low,int high,int index,int l,int r,int val){
    if(low>high or l>r or l>high or low>r)
        return 0;
    if(low>=l and high<=r){
        return seg[index].end()-lower_bound(all(seg[index]),val);   
    }
    int mid=(low+high)/2;
    return query(low,mid,index*2+1,l,r,val)+query(mid+1,high,index*2+2,l,r,val);
}

int main()
{
    #if !ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n,m;cin>>n>>m;

    rep(i,n){
        int l,r;cin>>l>>r;
        x[l].pb(r);
    }     
    build(0,m,0);
    
    cout<<n<<"\n";
    
    for(int i=2;i<=m;i++){
        int ans=0;
        for(int j=i;j<=m;j+=i){
            //j-i+1 j
            ans+=query(0,m,0,j-i+1,j,j);
        }
        cout<<ans<<"\n";
    }   

}

Measured memory_bytes: 44432