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())
counter = 0
s, s1 = 0, 1
if n > x:
    s1 = x
    s = 1
elif not (n**2 < x or x/n != x//n or x//n > n):
     s = x//n
     s1 = x//s
if s != 0:
    for i in range(s, s1+1):
        if x/i == x//i:
            counter += 1
            s1 = x//i
print(counter)