#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<pa,int>
                            #define ppap pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }
int pr[100010];
int inv[100010];
 
int beki(int wa,int rr){
	if(rr==0) return 1ll;
	if(rr==1) return wa;
	if(rr%2==1) return (beki(wa,rr-1)*wa)%inf;
	int zx=beki(wa,rr/2);
	return (zx*zx)%inf;
}
 
 
void gya(){
	pr[0]=1;
	for(int i=1;i<100010;i++){
		pr[i]=(pr[i-1]*i)%inf;
	}
	for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
	
}



                         //----------------kokomade tenpure------------
int N=262144;
int data[262144]={0},datab[262144]={0};

void addseg(int a,int b,int x,int k,int l, int r){
//	if(l==r) return;
	if(a<=l && r<=b) data[k] += x;
	else if(l<b && a<r){
		datab[k] += (min(b,r)-max(a,l))*x;
		addseg(a,b,x,k*2+1,l,(l+r)/2);
		addseg(a,b,x,k*2+2,(l+r)/2,r);
	}
}

int sumseg(int a,int b,int k,int l,int r){ //k-th kukan ga [l,r)
	if(b<=l || r<=a) return 0;
	else if(a<=l && r <= b) return data[k]*(r-l)+datab[k];
	else{
		ll res=(min(b,r)-max(a,l))*data[k];
		res += sumseg(a,b,k*2+1,l,(r+l)/2);
		res += sumseg(a,b,k*2+2,(l+r)/2,r);
		return res;
	}
}
int n,m;
vector<int> G[100020];
signed main(){
cin>>n>>m;
	for(int i=0;i<n;i++){
		int lll,rrr;
		cin>>lll>>rrr;
		G[rrr-lll+1].pb(lll);
	}
	int e=n;
	for(int d=1;d<=m;d++){
		int ans=e;
	//	cout<<"e= "<<e<<endl;
		if(d>1){
			for(int i=d;i<=m;i+=d){
	//			cout<<"ch "<<i<<" "<<sumseg(i,i+1,0,0,m+100)<<endl;
				ans+=sumseg(i,i+1,0,0,m+100);
			}
		}
		for(int i=0;i<G[d].size();i++){
			addseg(G[d][i],G[d][i]+d,1,0,0,m+100);
	//		cout<<"sum "<<G[d][i]<<G[d][i]+d<<endl;
		}
		cout<<ans<<endl;
		e -= G[d].size();
	}
	
	return 0;
}




Measured memory_bytes: 11648