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 sys import stdin

def divs(n):
    if n == 1: return [(1,1)]
    ret = []
    for x in range(1,n):
        if x*x > n: break
        if n%x == 0:
            ret.append((x,n//x))
    return ret

a, b = [int(n) for n in stdin.readlines()[0].split()]
div_arr = divs(b)
S = 0
for t in div_arr:
    if t[0] <= a and t[1] <= a:
        if t[0] == t[1]:
            S += 1
        else:
            S += 2
print(S)

