output_description: Print the number of the sequences consisting of positive integers that satisfy
  the condition, modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
attempt: import collections
  
  def factor(m):
      num=m
      s=[]
      i=2
      while i*i<=m:
          if num%i:
              i+=1
          else:
              s.append(i)
              num//=i
      if num!=1:
          s.append(num)
      return s
  
  def conb(n,r):
      r=min(r,n-r)
      if r==0:
        return 1
      else:
        N,R=n,r
      	for i in range(1,r):
          	N*=n-i
          	R*=r-i
      	return N//R
  	
  n,m=map(int,input().split())
  a=factor(m)
  b=collections.Counter(a)
  mod=10**9+7
  ans=1
  for i in b.values():
      ans=(ans*conb(n+i-1,i))%mod
  print(ans)
problem_description: Statement
  
  You are given positive integers N and M.
  
  How many sequences a of length N consisting of positive integers satisfy a_1
  \times a_2 \times ... \times a_N = M? Find the count modulo 10^9+7.
  
  Here, two sequences a' and a'' are considered different when there exists some
  i such that a_i' \neq a_i''.
samples: [{"input": "2 6", "output": "4\n    \n\nFour sequences satisfy the condition: \\\\{a_1, a_2\\\\} = \\\\{1, 6\\\\}, \\\\{2, 3\\\\},\n\\\\{3, 2\\\\} and \\\\{6, 1\\\\}.\n\n* * *"}, {"input": "3 12", "output": "18\n    \n\n* * *"}, {"input": "100000 1000000000", "output": "957870001"}]