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 = 'import sys\ndef input():\n    return sys.stdin.readline()[:-1]\nN, M = map(int, input().split())\nL = []\nfor i in range(N):\n    l, r = map(int, input().split())\n    L.append((r-l+1, l, r+1))\nL.sort()\n\n\nclass Bit:\n    """\n    0-indexed\n    # 使用例\n    bit = Bit(10)  # 要素数\n    bit.add(2, 10)\n    print(bit.sum(5))  # 10\n    """\n    def __init__(self, n):\n        self.size = n\n        self.tree = [0]*(n+1)\n\n    def sum(self, i):\n        s = 0\n        while i>0:\n            s += self.tree[i]\n            i -= i & -i\n        return s\n\n    def add(self, i, x):\n        i += 1\n        while i <= self.size:\n            self.tree[i] += x\n            i += i & -i\n\n\nclass BitImos:\n    """\n    ・範囲すべての要素に加算\n    ・ひとつの値を取得\n    の2種類のクエリをO(logn)で処理\n    """\n    def __init__(self, n):\n        self.bit = Bit(n+1)\n\n    def add(self, s, t, x):\n        # [s, t)にxを加算\n        self.bit.add(s, x)\n        self.bit.add(t, -x)\n\n    def get(self, i):\n        return self[i]\n\n    def __getitem__(self, key):\n        # 位置iの値を取得\n        return self.bit.sum(key+1)\n\n\nimos = BitImos(M+1)\nil = 0\na = N\nA = [0]*M\nfor i in range(1, M+1):\n    while il<N:\n        ra, l, r = L[il]\n        if i < ra:\n            break\n        il+=1\n        a-=1\n        imos.add(l, r, 1)\n    ans = 0\n    for j in range(i, M+1, i):\n        ans += imos[j]\n\n    A[i-1] = ans + a\n\nprint(*A, sep="\\n")\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14299