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 count_occurrences(n, x):
    count = 0
    i = 1
    j = n

    while i <= n and j >= 1:
        if i * j == x:
            count += 1
            i += 1
            j -= 1
        elif i * j < x:
            i += 1
        else:
            j -= 1

    return count

n, x = list(map(int,input().split()))
occurrence_count = count_occurrences(n, x)
print(occurrence_count)

			 	      	  	      		   	 	 	