#include <bits/stdc++.h>
using namespace std;

#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

const int inf=1e9;
const int64_t inf64=1e18;
const double eps=1e-9;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
    os << "[";
    for (const auto &v : vec) {
    	os << v << ",";
    }
    os << "]";
    return os;
}

using i64=int64_t;

vector<long long int> prime_factor(long long int n){
    vector<long long int> res;
    for(int i=2; i*i<=n; ++i){
        while(n%i==0){
            res.push_back(i);
            n/=i;
        }
    }
    if(n!=1) res.push_back(n);
    return res;
};

class segtree{
public:
    i64 n,size_;
    vector<vector<pair<int,int>>> segs;
    segtree()=default;
    segtree(i64 size){ init(size); }
    void init(i64 size){
        size_=size;
        n=1;
        while(n<size) n*=2;
        segs.resize(n*2-1);
    }
    void insert(int l_,int r_){ insert(0,n,0,l_,r_); }
    void insert(int a,int b,int index,int l_,int r_){
        if(b<=l_ or r_<=a) return;
        if(l_<=a and b<=r_){
            segs[index].push_back(make_pair(l_,r_));
            return;
        }
        insert(a,(a+b)/2,2*index+1,l_,r_);
        insert((a+b)/2,b,2*index+2,l_,r_);
    }
    int query(int lb,int x){ return query(0,n,0,lb,x); }
    int query(int a,int b,int index,int lb,int x){
        if(/*b<=lb*/ or x<a or b<=x) return 0;
        int res=0;
        if(lb<a and a<=x and x<b) res+=segs[index].end()-upper_bound(segs[index].begin(),segs[index].end(),make_pair(lb,inf));
        if((a+b)/2<b) res+=query(a,(a+b)/2,index*2+1,lb,x);
        if(a<(a+b)/2) res+=query((a+b)/2,b,index*2+2,lb,x);
        return res;
    }
};

void solve(){
    int N,M;
    cin >> N >> M;

    vector<pair<int,int>> LR;
    rep(i,0,N){
        int L,R;
        cin >> L >> R;
        ++R;
        LR.push_back(make_pair(L,R));
    }
    sort(LR.begin(),LR.end());
    segtree seg(M+1);
    rep(i,0,N) seg.insert(LR[i].first,LR[i].second);

    rep(i,1,M+1){
        int ans=0;
        rep(j,1,M/i+1){
            int tmp=seg.query(i*(j-1),i*j);
            ans+=seg.query(i*(j-1),i*j);
        }
        cout << ans << endl;
    }
}

int main(){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(10);
    solve();
    return 0;
}
