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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.PrintWriter;
import java.util.*;

public class Main {
	static class SegmentTree {
		int N;
		int[] v;
		public SegmentTree(int M) {
			N=1;
			while(M>N) {
				N<<=1;
			}
			v = new int[N*2];
		}
		public void add(int l, int r, int x) {
			add(l, r, 0, N, x, 1);
		}
		public void add(int l, int r, int a, int b, int x, int idx) {
			if(r<=a || b<=l) {
				;
			} else if(l<=a && b<=r) {
				v[idx] += x;
			} else {
				int mid = (a+b)/2;
				add(l, r, a, mid, x, idx*2);
				add(l, r, mid, b, x, idx*2+1);
			}
		}
		
		public int get(int p) {
			p += N;
			int ans = 0;
			while(p>=1) {
				ans += v[p];
				p>>=1;
			}
			return ans;
		}
		
	}
	
	static class Segment {
		int l,r;
		int length;
		public Segment(int l, int r) {
			this.l = l;
			this.r = r;
			length = r-l+1;
		}
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);

		int N = sc.nextInt();
		int M = sc.nextInt();
		Segment[] segments = new Segment[N];
		for(int i=0; i<N; i++)
			segments[i] = new Segment(sc.nextInt(), sc.nextInt());

		Arrays.sort(segments, new Comparator<Segment>() {
			public int compare(Segment s1, Segment s2) {
				return Integer.compare(s1.length, s2.length);
			}
		});
		
		SegmentTree st = new SegmentTree(M+1);
		
		int idx = 0;
		for(int i=1; i<=M; i++) {
			while(idx<N && segments[idx].length<i) {
				st.add(segments[idx].l, segments[idx].r+1, 1);
				idx++;
			}
			int ans = N-idx;
			for(int j=i; j<=M; j+=i)
				ans += st.get(j);
			pw.println(ans);
		}
		
		sc.close();
		pw.close();
	}
}