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.
def fact(n):
    i,l = 1,[]
    while i*i<=n:
        if n%i==0:
            if n//i==i: l.append(i)
            else:
                l.append(i)
                l.append(n//i)
        i+=1
    return l
    
n,m = map(int,input().split())
l,ans = fact(m),0
for i in l:
    for j in l:
        if i*j==m and i<=n and j<=n:
            ans+=1
print(ans)