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()))
m=[[0 for _ in range(n)] for _ in range(n)]
for i in range(n):
  for j in range(n):
    m[i][j]=(i+1)*(j+1)
nun=0
for k in range(n):
  for l in range(n):
    if m[k][l]==b:
      nun+=1
print(nun)
	 	 	 				 		    	  	  	 			