def dec(n, m, k):
  if k == 0:
    if n == 1:
      return 1
    else:
      return 0
  if k == 1:
    if n >= m:
      return 1
    else:
      return 0

  ret = 0
  d = m
  while d * d <= n:
    if n % d == 0 :
      nn = n
      cnt = 1
      while nn % d == 0 and k >= cnt:
        nn /= d
        ret += dec(nn, d + 1, k - cnt)
        cnt += 1
    d += 1
  return ret

N, X = map(int, input().split())
print(dec(X + 1, 2, N))