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.
import math
n,x=map(int,input().split(" "))
inc=2 if x&1 else 1
maxL=min(int(math.sqrt(x)),n)
l=min(maxL,x//maxL)
l+=1 if l==1 else 0
l+=1 if (x&1 and l&1!=1) else 0
while l<=maxL: #find valid l..such that for l*r=x, r<=n
    if x%l==0 and x//l<=n:
        break
    l+=inc
	
cnt=2 if x<=n else 0 #for pair[1,x]
while l<=maxL:
    if x%l==0:
        cnt+=2
    l+=inc
l-=inc
cnt-=1 if l*l==x else 0
print(cnt)