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 = 'from bisect import bisect\nfrom operator import itemgetter\n\nimport sys\ninput = sys.stdin.readline\n\ndef inpl(): return list(map(int, input().split()))\n\n\nclass BIT:\n    def __init__(self, N):\n        self.size = 2 ** (int.bit_length(N)+1)\n        self.tree = [0]*(self.size + 1)\n\n    def sum(self, i):\n        res = 0\n        while i:\n            res += self.tree[i]\n            i -= (i & -(i))\n        return res\n\n    def add(self, i, x):\n        if i == 0:\n            return\n        while i <= self.size:\n            self.tree[i] += x\n            i += (i & -(i))\n\n\nclass RABIT():\n    # range add BIT\n    def __init__(self, N):\n        self.bit0 = BIT(N)\n        self.bit1 = BIT(N)\n\n    def sum(self, i):\n        return i*self.bit1.sum(i) + self.bit0.sum(i)\n\n    def add_range(self, l, r, x):\n        self.bit0.add(l, -x*(l-1))\n        self.bit1.add(l, x)\n        self.bit0.add(r+1, x*r)\n        self.bit1.add(r+1, -x)\n\n    def get_range(self, l, r):\n        return self.sum(r) - self.sum(l-1)\n\n\nN, M = inpl()\nR, L, S = [], [], []\nQ = []\nfor _ in range(N):\n    l, r = inpl()\n    Q.append((l, r, (r-l+1)))\n\nQ = sorted(Q, key=itemgetter(2), reverse=True)\nrabit = RABIT(M+1)\n\nLmin = M\nRmax = 0\nfor i in range(1, M+1):\n    while Q and Q[-1][2] < i:\n        l, r, _ = Q.pop()\n        rabit.add_range(l, r, 1)\n        Lmin = min(Lmin, l)\n        Rmax = max(Rmax, r)\n    ans = len(Q)\n    for j in range(-(-Lmin//i) * i, Rmax+1, i):\n        ans += rabit.get_range(j, j)\n    print(ans)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 20131