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())

amt = 0
for i in range(n):
    endNumber = (i+1)*n
    if(x % (i+1) == 0):
        if(x / (i+1) <= n):
            amt += 1

print(amt)

#check: 12
#1 2 3 4 5 6
#2 4 6 8 1012
#3 6 9 121518
#4 8 12162024
#5 1015202532
#6 1218243036
