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.
#https://codeforces.com/problemset/problem/577/A
#[email protected]
n,x=map(int,input().split())
if x==1:
    print(1)
elif x<n:
    print(2)
else:
    count=0
    if n==x:
        count+=2
    for i in range(2,n+1):
        for j in range(i,n+1):
            if i*j==x:
                if i==j:
                    count+=1
                else:
                    count+=2
                i=j+1
                break
    print(count)