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())
if x > n * n:
    print(0)
    exit()
if x < 1:
    print(0)
if x == 1:
    print(1)
count = 0
sqx2 = int((x)**0.5)
sq_flag = False
for j in range(2, sqx2 + 1):
    if x % j == 0 and x // j <= n:
        count += 1
        if x // j == j :
            sq_flag = True
if x <= n :
    count += 1
print(count * 2 - sq_flag)