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;

// why am I so weak

int n, m;
int l[300055], r[300055];

int dat[400055];
int inter[400055];

typedef pair<int, int> P;

#define ft first
#define sd second

vector<int> event[100055];

void update(int id, int x, int y, int l, int r) {
	if (l > y || r < x) return;

	if (l <= x && y <= r) {
		dat[id]++;
		return;
	}

	int mid = (x + y) >> 1;

	update(id + id, x, mid, l, r);
	update(id + id + 1, mid + 1, y, l, r);
}
void update2(int id, int x, int y, int l, int r) {
	if (l > y || r < x) return;

	if (l <= x && y <= r) {
		inter[id]++;
		return;
	}

	int mid = (x + y) >> 1;

	update2(id + id, x, mid, l, r);
	update2(id + id + 1, mid + 1, y, l, r);
}
int query(int id, int x, int y, int w) {
	if (x == y) return dat[id];

	int mid = (x + y) >> 1;

	if (w <= mid) return dat[id] + query(id + id, x, mid, w);
	else return dat[id] + query(id + id + 1, mid + 1, y, w);
}
int query2(int id, int x, int y, int w) {
	if (x == y) return inter[id];

	int mid = (x + y) >> 1;


	if (w <= mid) return inter[id] + query2(id + id, x, mid, w);
	else return inter[id] + query2(id + id + 1, mid + 1, y, w);
}
int main() {
	scanf("%d %d", &n, &m);

	for (int i = 0; i < n; i++) {
		scanf("%d %d", &l[i], &r[i]);

		update(1, 1, m, 1, r[i] - l[i] + 1);
		event[r[i] - l[i] + 2].push_back(i);
	}

	for (int i = 1; i <= m; i++) {
		int res = query(1, 1, m, i);

		for (auto u : event[i]) {
			update2(1, 1, m, l[u], r[u]);
		}

		for (int j = i; j <= m; j += i) {
			res += query2(1, 1, m, j);
		}

		printf("%d\n", res);
	}

	return 0;
}