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.
#Multiplication Table Ejercice 2
#complejdiad O(i)
n, x = map(int, input().split())
count = 0
# (1 ≤ n ≤ 10^5, 1 ≤ x ≤ 10^9) 
if 1 <= n <= 100000 and 1 <= x <= 1000000000:
    for i in range(1, n+1):
        print(i, x % i,x/i)
        if x % i == 0 and x/i <= n:
            count += 1
            
    print(count)
	 			    	 	  	 	  					   	