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 math
# n table contions x ,prime factors of x


def helper(n,x):
    prime=[[1] for i in range(0,x+1)]
    for i in range(2,int(math.sqrt(x))+1):
        if len(prime[i])==1:
            for j in range(i*i,x+1,i):
                prime[j].append(i)
    count=0
    # print(prime[x])
    for f in prime[x]:
        if f in range(1,n+1) and x/f in range(1,n+1):
            # print(f,x/f)
            if f==x/f:
                count+=1
            else:
                count+=2
    return count    
n,x=list(map(int,input().split()))
print(helper(n,x))