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.
# def pfac(n):
#     l= []
#     i=2
#     while(i*i<=n):
#         if n%i==0:
#             l.append(i)
#             while(n%i==0):
#                 n//=i
#                 l.append(i)

#         i+=1
#     if n>1:
#         l.add(n)
#     return l
from math import sqrt
import math
x,y = map(int,input().split())
c=0
l=set()
for i in range(2,int(sqrt(y))+1):
    if y%i ==0 and y//i <=x:
        l.add(i)
        l.add(y//i)
if y<=x:
    c+=2
# print(l)
c+=len(l)
print(c)

