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.
def fac(n,x):
    l = []
    for i in range(1,n+1):
        if n%i == 0 and i <= x:
            l.append(i)
    return l
k = input()
w =  [int(i) for i in k.split() if i.isdigit()]
h = fac(w[1],w[0])
g = []
for i in range(0,len(h)):
    if (h[i],w[1]//h[i]) and (w[1]//h[i],h[i]) not in g and w[1]//h[i] <= w[0]:
        g.append((h[i],w[1]//h[i]))
        g.append((w[1]//h[i],h[i]))
print(len(g))
#print(h)                
            