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()]


if a[1] != 1 and a[1] != 1000000000:
    good = [int(y) for y in range(a[0]+1)]
    c = [int(z) for z in range(a[0]+1)]
    tabl = []
    if a[1] != 1:
        for x in range(1, len(good)):
            for h in range(1, len(good)):
                b = good[x]*c[h]
                tabl.append(b)
        print(tabl.count(a[1]))
    else:
        print(1)
else:
    print(a[1])