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.
from math import sqrt


def foo(x):
    a = []
    for i in range(1, int(sqrt(x)) + 1):
        if x % i == 0:
            a.append((i, x // i))
    return a


n, x = [int(i) for i in input().split()]
a = foo(x)
cnt = 0
for i in a:
    if i[0] <= n and i[1] <= n:
        cnt += 1
print(cnt * 2)
