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.
x, n = map(int, input("Введите x, n: ").split())

i = 1
kol = 0
a = []
while i * i <= n:
    if n % i == 0:
        a.append(i)
        a.append(n // i)
        if a[0] <= x and a[1] <= x:
            kol += 1
        a.clear()
    i += 1
print(kol * 2)
