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
a, b = list(map(int, input().split()))
c = []
for i in range(2, int(sqrt(b))+1):
    if b % i == 0:
        c.append(i)
        if i*2 <= (b//2):
            c.append(i*2)
if a == 1 and b == 1:
    print(a)
elif len(c) == 0 and a >= b:
    print(2)
elif len(c) == 0:
    print(0)
elif len(c) > 0 and a >= b:
    print(len(c)+2)
elif len(c) > 0 and a <= b:
    print(len(c))
