1 #include <cstdio>
 2 #include <algorithm>
 3 
 4 #define lowbit(x) (x&(-x))
 5 
 6 using std::sort;
 7 
 8 const int maxn = 300010;
 9 
10 int n, m, c[maxn];
11 
12 struct node {
13     int l, r, len;
14     bool operator < (const node &a) const {
15         return len < a.len;
16     }
17 }a[maxn];
18 
19 void add(int i, int x) {
20     while(i <= m) c[i] += x, i += lowbit(i);
21 }
22 
23 int ask(int i) {
24     int ret = 0;
25     while(i > 0) ret += c[i], i -= lowbit(i);
26     return ret;
27 }
28 
29 int main() {
30     scanf("%d %d", &n, &m);
31     for(int i = 1;i <= n;i ++) {
32         scanf("%d %d", &a[i].l, &a[i].r);
33         a[i].r ++, a[i].len = a[i].r - a[i].l;
34     }
35     sort(a + 1, a + n + 1);
36     for(int i = 1, j = 1, ans;i <= m;i ++) {
37         while(j <= n && a[j].len < i) {
38             add(a[j].l, 1);
39             add(a[j].r, -1);
40             j ++;
41         }
42         ans =  n - j + 1;
43         for(int k = i;k <= m;k += i)
44             ans += ask(k);
45         printf("%d\n", ans);
46     }
47 }