Problem:
Score : 700 points

Problem Statement

Snuke has decided to play a game, where the player runs a railway company.
There are M+1 stations on Snuke Line, numbered 0 through M.
A train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.
For example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.

There are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.

There are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.
For each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.
Here, assume that it is not allowed to change trains.

Constraints

1 ≦ N ≦ 3 × 10^{5}

1 ≦ M ≦ 10^{5}

1 ≦ l_i ≦ r_i ≦ M

Input

The input is given from Standard Input in the following format:

N M
l_1 r_1
:
l_{N} r_{N}

Output

Print the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.

Sample Input 1

3 3
1 2
2 3
3 3

Sample Output 1

3
2
2

If one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.

If one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.

If one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.

Sample Input 2

7 9
1 7
5 9
5 7
5 9
1 1
6 8
3 4

Sample Output 2

7
6
6
5
4
5
5
3
2

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n)repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
typedef pair<int,int> P;
typedef pair<int, P> PP;
#define all(v) v.begin(),v.end()
#define fi first
#define se second
const int inf = 1e9;
int mod = 1e9+7;

int bitn = 1, bit[200002];
int L[300002], R[300002];
void add(int l, int r){
	while(l <= bitn){
		bit[l]++;
		l += l&-l;
	}
	r++;
	while(r <= bitn){
		bit[r]--;
		r += r&-r;
	}
}
int get(int x){
	int res = 0;
	while(x > 0){
		res += bit[x];
		x -= x&-x;
	}
	return res;
}

vector<PP> v;
signed main(){
	int n, m;
	scanf("%lld%lld", &n, &m);
	rep(i,n)scanf("%lld%lld", &L[i], &R[i]);
	while(bitn < m)bitn *= 2;
	rep(i,n)v.push_back(PP(R[i]-L[i], P(L[i], R[i])));
	sort(all(v));
	
	int s = n, cnt = 0, ans = 0;
	rrep(i,m){
		while(cnt < n && i > v[cnt].fi){
			add(v[cnt].se.fi, v[cnt].se.se);
			cnt++;s--;
		}
		int sum = 0;
		rrep(j,m){
			if(i*j > m)break;
			sum += get(i*j);
		}
		printf("%lld\n", sum+s);
	}
	return 0;
}