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())
list = []
for i in range(1,x+1):
    if x % i == 0 and i != 1 and i <= n:
        list.extend([[i,x//i]])
if n % x == 0 and x != 1 and x <= n:
    list.extend([[n,x]])
count = 0
for j in range(len(list)):
    k = list[j]
    if k[0] <= n+1 and k[1] <= n+1:
        count += 1
print(count)


