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

def factors1(x):
    k = int(sqrt(x))
    out = []
    for i in range(1, k+1):
        if x%i == 0:
            out.append(i)
            if x//i != i: 
                out.append(x//i)
    out.sort()
    return out
    
m = factors1(x)
l = len(m)

if l%2 == 1:
    f = m.pop(l//2)
    if f<=n:
        count = 1 
else:
    count = 0

left = m[:l//2]
right = m[l//2:][::-1]

for (a, b) in zip(left, right):
    if a<=n and b<=n:
        count += 2 
print(count)
