output_description: Print the number of the positive divisors of N!, modulo 10^9+7.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
attempt: n, k = map(int, input().split())
  d = []
  for _ in range(n):
      d.append(list(map(int, input().split())))
  d.sort(key=lambda x: x[0])
  count = 0
  for x, y in d:
      count += y
      if count >= k:
          break
  print(x)
  
problem_description: Statement
  
  You are given an integer N. Find the number of the positive divisors of N!,
  modulo 10^9+7.
samples: [{"input": "3", "output": "4\n    \n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\n* * *"}, {"input": "6", "output": "30\n    \n\n* * *"}, {"input": "1000", "output": "972926972"}]