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.
def inp(sa):
	b=[]
	j=0	
	for i in range(len(sa)):
		if sa[i]==" ":
			b.append(int(sa[j:i]))
			j=i+1
	b.append(int(sa[j:]))
	return b

		
a=input()
a=inp(a)
sum=0
for i in range(1,a[0]+1):
	if a[1]%i==0 and a[1]//i<=a[0]:
		sum+=1
		
print(sum)	
		
				