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.
from math import sqrt 
n, x = [int(i) for i in input().split()]
ans = 0 
for i in range(1, int(sqrt(x))+1): 
    if x%i == 0: 
        q1 = i 
        q2 = x//i 
        print(q1, q2, ans)
        if q1 <= n and q2 <= n and q1 != q2: ans += 2
        if q1 <= n and q2 <= n and q1 == q2: ans += 1
print(ans)