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 = list(map(int, input().split()))
if x == 1 or x == n * n:
   print(1)

else:
   row = list(int(i) for i in range(1,n+1))
   li = [[int((r)*(c)) for c in range(1,n+1)] for r in row]
   if(n>x):
     n = x
     li = []
     for r in row:
        c = 1
        if x%c != 0: c += 1 ; continue
        li.append([int((r)*(c)) for c in range(1,n+1)])
        if(len(li)== n): break
     
   print(sum(li[i].count(x) for i in range(n))) 