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 prime(n):
    for i in range(2,int(pow(n,0.5))):
        if n%i==0: return False
    return True

n,x = map(int,input().split())
count =0

for i in range(1,n+1):
    if x%i==0:
        count+=1

if x>n and prime(x):
    print(0)
elif x>n: print(count-1)
else: print(count)