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 Rust (1.15.1) (judge verdict: Accepted)

#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m) = (v[0], v[1]);
    let mut spans = vec![];
    for i in 0..n {
        let v = read_vec::<usize>();
        let (l, r) = (v[0], v[1]);
        spans.push((r + 1 - l, l, r));
    }
    spans.sort();
    // spans.reverse();

    let mut answers = vec![0; m + 1];
    let mut spans_pointer = 0;
    let mut seg = LazySegmentTree::new(m + 1);
    for mi in 1..m + 1 {
        while spans_pointer < spans.len() && spans[spans_pointer].0 < mi {
            let (_, l, r) = spans[spans_pointer];
            seg.add(l, r + 1, 1, 0, 0, m + 1);
            spans_pointer += 1;
        }
        answers[mi] = spans.len() - spans_pointer;
        let mut cur_pos = mi;
        while cur_pos <= m {
            answers[mi] += seg.getsum(cur_pos, cur_pos + 1, 0, 0, m + 1) as usize;
            cur_pos += mi;
        }
    }
    for &ans in &answers[1..m + 1] {
        println!("{}", ans);
    }
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Debug)]
struct LazySegmentTree {
    n: usize,
    data: Vec<i64>,
    datb: Vec<i64>,
}

impl LazySegmentTree {
    fn new(sz: usize) -> LazySegmentTree {
        let mut n = 1;
        while n < sz {
            n *= 2;
        }
        LazySegmentTree {
            n: n,
            data: vec![0i64; 2 * n - 1],
            datb: vec![0i64; 2 * n - 1],
        }
    }

    fn add(&mut self, a: usize, b: usize, x: i64, k: usize, l: usize, r: usize) {
        if a <= l && r <= b {
            self.data[k] += x;
        } else if l < b && a < r {
            self.datb[k] += (min(b, r) - max(a, l)) as i64 * x;
            self.add(a, b, x, k * 2 + 1, l, (l + r) / 2);
            self.add(a, b, x, k * 2 + 2, (l + r) / 2, r);
        }
    }

    fn getsum(&mut self, a: usize, b: usize, k: usize, l: usize, r: usize) -> i64 {
        if b <= l || r <= a {
            return 0;
        }
        if a <= l && r <= b {
            return self.data[k] * (r - l) as i64 + self.datb[k];
        } else {
            let mut res = (min(b, r) - max(a, l)) as i64 * self.data[k];
            res += self.getsum(a, b, k * 2 + 1, l, (l + r) / 2);
            res += self.getsum(a, b, k * 2 + 2, (l + r) / 2, r);
            return res;
        }
    }
}