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
def square_checker(n,m) :
    for i in range(1,m+1) :
        if i**2 == n :
            return i
        if i**2 > n :
            return -1
    return -1
def mazrab_checker(n,m) :
    c=0
    for i in range(1,m+1) :
        if n%i == 0 and n//i <= m+1 :
            c += 1
    return c
b,a=[int(x) for x in input().split()]
print(mazrab_checker(a,b))