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.
# t = int(input())
t = 1

def isDist(x: str):
  for i in range(len(x)-1):
    if x[i] == x[i+1]:
      return False
  return True

def numFactors(x: int, num: int):
  i=1
  c = 0
  while i<num:
    z = x / i
    if z == int(z):
      if z <= num:
        c+=1
    i+=1
  check = x/num
  if check == int(check):
    c+=1
  return c


def cp():
  # code here
  n,x = tuple(map(int,input().split()))
  
  print(numFactors(x,n))








for i in range(t):
  cp()
