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


def check(x):
    a = set()
    for i in range(1, int(x ** 0.5) + 1):
        if x % i == 0:
            a.add((i, x // i))
            a.add((x // i, i))

    return a


for i in check(x):
    if i[0] <= n and i[1] <= n:
        counter += 1
print(counter)
