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,m = map(int,input().split())
coun = 0
if m==1 or n==m==1:
    coun=1

else:
    for i in range(2,math.floor(m/2)+1):
        if m%i==0:
            coun+=1
    
if m<=n and n!=1 and m!=1:
    coun+=2

print(coun)
        
    