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.
import bisect
left  = lambda l,a : bisect.bisect_left(l,a)  #returns index of value>=a
right = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a
import sys
def input(): return sys.stdin.readline().strip()
def getints(): return map(int,sys.stdin.readline().strip().split())

n,x = getints()
ans = 0
for i in range(1,int(x**0.5)+1):
    if i<=n and x%i == 0 and x/i<=n:
        ans += 2 if i != x/i else 1
print(ans)