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.
l=[int(i)for i in input().split()]
n,x=l[0],l[1]
s=0
l1=[]
if x not in range(1,n*n+1):
    print(0)
else:
    for i in range(1,n+1):
        if x%i==0 and x<=i*n:
            for j in range (1,n+1):
                if x==i*j:
                    if i==j:
                        s+=1
                    else:
                        s+=1
print (s)