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,x) = map(int,input().split())
c = 0
mid = n//2
k = set()
for i in range(1,mid+1):
	div = x/i

	if(div == int(div) and div <= n):
		if(int(div) == i and div not in k):
			c += 1
		elif(div not in k):
			c += 2
		k.add(i)
		k.add(int(div))



print(c)