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 = 'class BIT: #0-indexed\n    def __init__(self, n):\n        self.size = n\n        self.tree = [0]*(n+1)\n        self.depth = n.bit_length()\n        self.n0 = 1<<self.depth\n#        self.element = [0]*(n+1)\n    def get_sum(self, i): #a_0 + ... + a_{i} #閉区間\n        s = 0; i += 1\n        while i > 0:\n            s += self.tree[i]\n            i -= i & -i\n        return s\n    def query(self,l,r): #a_l + ... + a_r 閉区間\n        return self.get_sum(r) - self.get_sum(l-1) \n    def add(self, i, x):\n        i += 1\n        while i <= self.size:\n            self.tree[i] += x\n            i += i & -i\n        # self.element[i] += x\n    #def get(self,i): return element[i]        \n    def bisect_left(self,w):\n        #和が w 以上になる最小の index\n        #w が存在しない場合 self.size を返す\n        if w <= 0: return 0\n        x,k = 0,self.n0\n        for _ in range(self.depth):\n            k >>= 1\n            if x+k <= self.size and self.tree[x+k] < w:\n                w -= self.tree[x+k]\n                x += k\n        return x\n    \n\n# coding: utf-8\n# Your code here!\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\nn,m,*lr = map(int,read().split())\n\nmp = iter(lr)\ndlr = [(r-l+1,l,r) for l,r in zip(mp,mp)]\ndlr.sort(reverse=True)\n\nans = [0]*(m+1)\n\nb = BIT(m+2)\n\nfor i in range(1,m+1):\n    while dlr and dlr[-1][0] < i:\n        d,l,r = dlr.pop()\n        b.add(l,1)\n        b.add(r+1,-1)\n        #print(i,l,r)\n    \n    v = 0\n    for j in range(i,m+1,i):\n        v += b.get_sum(j)\n    #print(b.get_sum(1),b.get_sum(2),b.get_sum(3), b.get_sum(4))   \n            \n    ans[i] = len(dlr) + v\n\nprint(*ans[1:],sep="\\n")\n\n\n\n\n\n\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 16685