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.
from math import sqrt
x,y = map(int,input().split())
if y==1 and x==1 :
    print(1)
elif x==1 and y!=1:
    print(0)
else:
    c=0
    l=set()
    for i in range(2,int(sqrt(y))+1):
        if y%i ==0 and y//i <=x:
            l.add(i)
            l.add(y//i)
    if y<=x:
        c+=2
    # print(l)
    c+=len(l)
    print(c)
