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.
n , x =map(int,input().split(' '))
def mu(i,j,sum=0):
    if j==n and i !=n:
        if i*j==x:
            return mu(i+1,1,sum+1)
        else:
            return mu(i+1,1, sum)
    if i==n and j==n:
        if n*n==x:
            return sum +1
        else:
            return sum
    else:
        if i*j==x:
            return mu(i,j+1,sum+1)
        else:
            return mu(i, j + 1, sum)

print(mu(1,1,0))