output_description: Print the number of sequences, modulo 10^9+7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: def main():
      N, K = map(int, input().split())
  
      def r(C, D):
          newD = {}
          for key in D.keys():
              for n in range(1, N + 1):
                  if int(key) * n <= N:
                      if key in newD:
                          newD[key] = D[key]
                      else:
                          newD[key] = newD[key] + D[key]
          if C == 10:
              return newD
          else:
              r(C + 1, D)
  
      C, D = 1, {}  # count, dict
      for n in range(1, N + 1):
          D[str(n)] = 1
      newD = r(C, D)
      return sum(newD.values()) % (10**9 + 7)
  
  
  print(main())
  
problem_description: Statement
  
  Find the number of sequences of length K consisting of positive integers such
  that the product of any two adjacent elements is at most N, modulo 10^9+7.
samples: [{"input": "3 2", "output": "5\n    \n\n(1,1), (1,2), (1,3), (2,1), and (3,1) satisfy the condition.\n\n* * *"}, {"input": "10 3", "output": "147\n    \n\n* * *"}, {"input": "314159265 35", "output": "457397712"}]