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())
k=0
if n*n<x:
    print(0)
elif n%2==0:
    for i in range(1,n//2+1):
        if x%i==0 and x//i<=n:
            if x//i==i:
                k+=1
            elif x//i>i:
                k+=2
    print(k)
else:
    for i in range(1,n//2+1):
        if x%i==0 and x//i<=n:
            if x//i==i:
                k+=1
            elif x//i>i:
                k+=2
    if x%(n//2+1)==0 and x//(n//2+1)<=(n//2+1):
        k+=1
    print(k)