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.
n,x =map(int, input().split())
a=[]
t=0
w=0
e=((n//2)**2)
if x<=e:
    for i in range(1, n//2+1):
        for j in range(1, i + 1):
            t = i * j
            if t == x:
                if i == j:
                    w += 1
                else:
                    w += 2
else:
    for i in range(n//2, n + 1):
        for j in range(1, i + 1):
            t = i * j
            if t == x:
                if i == j:
                    w += 1
                else:
                    w += 2
print(w)