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.
#577A - Multiplication Table
def isPrime(n):
    if n==1 or n%2==0:
        return False
    for i in range(3,int(n**0.5)+1,2):
        if n%i==0:
            return False
    return True
[a,b],m=list(map(int,input().split())),0
if isPrime(b):
  if a>=b: 
    print(2)
  else:
    print(0)
else:
  for i in range(1,a+1):
    for j in range(a,i-1,-1):
      if i*j==b:
        m+=1
  x=b**0.5
  if x%1==0 and x<=a:
    print((m*2)-1)
  else:
    print(m*2)