#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

//区間add 区間sumクエリ
template<typename T>
class LazySegmentTree{
private:
	vector<T> dat;
	vector<T> lazy;
	T e;
	int n;
	
public:
	LazySegmentTree(int sz,T init){
		n = 1;
		while(sz > n) n <<= 1;
		dat = vector<T>(2*n,init);
		lazy = vector<T>(2*n,init);
		e = init;
	}

	T f(T x, T y){
		return x+y;
	}

	int size() {return n;}

	void update(int l, int r, T t){
		function<T(int,int,int)> rec = [&](int x, int y, int k) -> T{
			prop(k);
			if(r <= x or y <= l) return dat[k];
			if(l <= x and y <= r){ //今見ている区間が完全に含まれる
				lazy[k] = f(t*(y-x),lazy[k]);
				prop(k);
				return dat[k];
			}else{
				int m = x+(y-x)/2;
				prop(k);
				auto tmp = f(rec(x,m,2*k+1),rec(m,y,2*k+2));
				return dat[k] = tmp;
			}
		};
		rec(0,n,0);
	}

	void prop(int k){
		dat[k] = f(lazy[k],dat[k]);
		if(2*k+1 < 2*n) lazy[2*k+1] = f(lazy[2*k+1],lazy[k]/2);
		if(2*k+2 < 2*n) lazy[2*k+2] = f(lazy[2*k+2],lazy[k]/2);
		lazy[k] = e;
	}

	void lazy_prop(int l, int r){
		function<void(int,int,int)> rec = [&](int a, int b, int k){
			if(r <= a or b <= l) return;
			int m = a+(b-a)/2;
			prop(k);
			if(!(l <= a and b <= r)){
				rec(a,m,2*k+1);
				rec(m,b,2*k+2);
			}
		};
		rec(0,n,0);
	}

	T query(int l, int r){
		lazy_prop(l,r);
		function<T(int,int,int)> rec = [&](int a, int b, int k) -> T{
			if(r <= a or b <= l) return e;
			int m = a+(b-a)/2;
			if(l <= a and b <= r){
				return dat[k];
			}else{
				return f(rec(a,m,2*k+1),rec(m,b,2*k+2));
			}
		};
		return rec(0,n,0);
	}

	// void debug(){
	// 	dpite(ALL(dat));
	// 	dpite(ALL(lazy));
	// }
};

int main()
{
	ios_init();
	int n,m;
	while(cin >> n >> m) {
		vector<int> l(n),r(n);
		REP(i,n) cin >> l[i] >> r[i];
		vector<P> ra(n);
		REP(i,n) ra[i] = {r[i]-l[i]+1,i};
		sort(ALL(ra));
		LazySegmentTree<int> seg(m+1,0);
		int p = 0;
		FOR(d,1,m+1){
			while(p < n and ra[p].F < d){
				seg.update(l[ra[p].S],r[ra[p].S]+1,1);
				DEBUG(l[ra[p].S]); DEBUG(r[ra[p].S]);
				p++;
			}
			int j = 0;
			int ans = n-p;
			while(j <= m){
				DEBUG(j); DEBUG(seg.query(j,j+1));
				ans += seg.query(j,j+1);
				j += d;
			}
			cout << ans << endl;
		}
	}
	return 0;
}


Measured memory_bytes: 7808