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,b=list(map(int,input().split()))
def factors(x):
  f=[]
  for i in range(1, x + 1):
    if x % i == 0:
      f.append([x/i,i])
  return f
nun=factors(b)
c=0       
for i in range(0,len(nun)):
  if n>=nun[i][0] and n>=nun[i][1]:
    c+=1

print((c))
	   	 		  	 	 	   	  	   			  	