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.
a = [int(i) for i in input().strip().split()]
f = []

if a[0]**2 > a[1]:
    for x in range(1, int(a[1]**0.5)):
        if a[1] % x == 0:
            f.append(x)
    if len(f) == 1:
        print(2)
    else:
        if a[0]**2 > a[1]:
            print(len(f)*2)
        else:
            print(0)
else:
    print(0)