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.
from math import ceil
def fact(num,beg):
    p=num**(0.5)
    if int(p)==p:
        ans=0
        for i in range(beg,int(p)+1):
            if num%i==0:
                ans+=1
        ans*=2
        ans-=1
    else:
        ans=0
        for i in range(beg,ceil(p)):
            if num%i==0:
                ans+=1
        ans*=2
    return ans

n,m=tuple(map(int,input().split()))
if n>m:
    beg=1
else:
    beg=ceil(m/n)
print(fact(m,beg))