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 , m = list(map(int , input().split()))

count = 0

for i in range(1 , n + 1 ):
    for j in range(1 , n + 1 ):
        if(i * j == m):
            count += 1 
        else:
            continue
if(m == 1):
    print(1)
elif(m == 2 or m == 3 or m == 5 or m == 7):
    print(2)
else:
    print(count)
