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 factors(n,limit):
    i = 1
    same = 0
    diff = 0
    while i*i <= n:
        if n%i == 0:
            if n//i != i:
                if n//i <=limit and i <= limit:
                    diff +=1
            else:
                if i <= limit:
                    same +=1
        i+=1
    return (2*diff)+same

limit,n = map(int,input().split())
print(factors(n,limit))