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())
v=1
s=[]
while v<=n:
    s.append(v)
    v=v+1
c=0
i=0

while i!=n**2:
    while i < n * int(s[0]):

        i=i+int(s[0])
        if i==x:
            c=c+1
    s=s[1:]
    if len(s)<1:
        break
    i=int(s[0])
print(c)

