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.
def max_divisors(a):
    d = set()
    d.add(a)
    for i in range(2, int(a**0.5) + 1):
        if a % i == 0:
            d.add(max(i, a // i))
    return d


n, x = map(int, input().split())
k = 0
for i in max_divisors(x):
    if n >= i:
        k += 2
print(k)
