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*
n,m = [int(i) for i in input().split()]
b = []
c = []
for i in range(1, int(sqrt(m))+1):
    if m%i == 0:
        b.append(i)
        c.append(m//i)
l = 0
for i in range(len(b)):
    if b[i] <= n and c[i] <= n and b[i] != c[i]:
        l += 2
    elif b[i] <= n and c[i] <= n:
        l+=1
print(l)