Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i* × *j*. The rows and columns are numbered starting from 1.

You are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.
The single line contains numbers *n* and *x* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the size of the table and the number that we are looking for in the table.
r=list(map(int,input().split()))
a=r[0]
b=r[1]
c=[]
d=0
if a**2<b:
    print(d)
elif a**2==b:
    print(d+1)
else:
    for i in range(1,(b //2)+1):
        if (b%i==0):
            c=c+[i]
    c=c+[b]
    for i in range(len(c)):
        if(c[i]>a):
            break
        if (c[i]<=a)and(b //c[i]<=a):
            d+=1
    print(d)