import sys
input = sys.stdin.readline
from collections import defaultdict


class Prime:
    def __init__(self, number):  # N以下の素数
        self.jud = [True] * (number + 5)
        self.pri = []
        self.jud[0] = False
        self.jud[1] = False

        for i in range(number):
            if self.jud[i]:
                self.pri.append(i)
                for j in range(2, (number) // i + 1):
                    self.jud[i * j] = False

    def judge(self, x):
        return self.jud[x]

    def decom(self, x):
        s = x
        a = defaultdict(int)
        if s == 1:
            return a
        while s > 1:
            for p in self.pri:
                if s % p == 0:
                    a[p] += 1
                    s = s // p
                    break
        return a


N,M=map(int,input().split())
L=[tuple([int(i) for i in input().split()]) for i in range(N)]
Ki=Prime(M+1)
A=Ki.pri
#print(A)

def f(x):
    num=0
    for l,r in L:
        if l%x==0:
            num+=1
        elif r%x==0:
            num+=1
        elif l//x<r//x:
            num+=1
    return num

dd=defaultdict(int)
for a in A:
    for i in range(32):
        if pow(a,i)>M:
            break
        dd[pow(a,i)] = f(pow(a,i))
#print(dd)
print(dd[1])
for i in range(2,M+1):

    di=Ki.decom(i)
    L=[]
    for p,n in di.items():
        L.append(pow(p,n))
    ans=0
    t=len(L)
    if t==1:
        print(dd[i])
        continue
    for j in range(t<<1):
        num=0
        s=1
        coef=0
        for k in range(t):
            if j & (1<<k):
                s*=L[k]
                coef+=1
        if s==i:
            continue
        ans+=((-1)**(t-coef-1))*dd[s]
        #print(ans,coef,s,dd[s])
    dd[i]=ans
    print(ans)




