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 factors(n :int) -> list:
    result = []
    for i in range(1, n//2):
        if not n % i:
            result.append(i)
    result.append(n)
    return result

inputs = list(map(int, input().strip().split()))
n = inputs[0]
x = inputs[1]
facts = factors(x)
result = 0
for i in facts:
    if i < n and x/i < n:
        result += 1
print(result)
