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())
n2 = n
i = 1
g = 1
c=[]
x1=0
while i<=n2:
    while n>i:
        n-=i
        if n==x:
            x1+=1
        c.append(n)
    g+=1
    n=n2*g        
    i+=1
y=1
while y<=n2:
    c.append(n2*y)
    if n2*y==x:
        x1+=1
    
    y+=1
    
print(x1)
