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.
import math
def helper(n,k):
	count=0
	factors=[[] for i in range(0,n+1)]
	for i in range(1,min(int(math.sqrt(n))+1,k+1)):
		if n%i==0:
			if n//i>k:
				continue
			elif n//i!=i :
				count+=2
			
			else:
				print(i)
				count+=1
	return count
n,k=list(map(int,input().split()))
print(helper(k,n))