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-----
3 3
1 2
2 3
3 3

-----Sample Output-----
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.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '\ndef bitadd(a,w,bit): #aにwを加える(1-origin)\n \n    x = a\n    while x <= (len(bit)-1):\n        bit[x] += w\n        x += x & (-1 * x)\n \ndef bitsum(x,bit): #ind 1～aまでの和を求める\n   \n    ret = 0\n    while x:\n        ret += bit[x]\n        x -= x & (-1 * x)\n    return ret\n\n\n#区間更新BIT(BITを2つ用意し、BITの長さをN+2で初期化しておくべし)\ndef bitaddR(l,r,w,bit1,bit2): #半開区間[l,r)にwを加える\n\n    bitadd(l,-1*w*l,bit1)\n    bitadd(r,w*r,bit1)\n    bitadd(l,w,bit2)\n    bitadd(r,-1*w,bit2)\n\ndef bitsumR(r,bit1,bit2): #半開区間[1,r)の区間和\n\n    return bitsum(r,bit1) + r * bitsum(r,bit2)\n\n\nN,M = list(map(int,input().split()))\n\nBIT = [0] * (M+1)\ndic = {}\nfor i in range(N):\n    l,r = list(map(int,input().split()))\n    if r-l+1 not in dic:\n        dic[r-l+1] = []\n    dic[r-l+1].append([l,r])\n\nind = 0\nns = N\nans = []\nfor d in range(M):\n\n    d += 1\n\n    if d in dic:\n        for L,R in dic[d]:\n\n            bitadd(L , 1 ,BIT)\n            bitadd(R+1 , -1 , BIT)\n            ns -= 1\n\n    nm = 0\n    for i in range(d,M+1,d):\n        \n        nm += bitsum(i,BIT)\n    ans.append(nm+ns)\n\nprint(("\\n".join(map(str,ans))))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14087