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, t = map(int,input().split())
t = long(t)

divisor = []

for i in range(1, t):
	if t%i==0:
		divisor.append(i)
divisor.append(t)

ans = len(divisor)
x = ans

if x%2==0:
	x1 = int(x/2)
	for i in range(x1, x):
		if divisor[i]>n:
			ans-=2
else:
	x1 = int(round(x/2,0))
	for i in range(x1, x):
		if divisor[i]>n:
			ans-=2
	if n**n<t:
		ans-=1

print(ans)