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,floor
n,x=map(int,input().split())
L=[]
for i in range(1,x+1):
    if x%i==0:
        L.append(i)
k=0
while k<len(L):
    if L[k]>n:
        temp=L[k]
        L.pop(k)
        if sqrt(x)!=floor(sqrt(x)):
            L.remove(x//temp)
            k-=1
    else:
        k+=1
print(len(L))