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 hersCode(l, r, n, N):
      ok = l
      ng = r + 1
      while abs(ok - ng) > 1:
          mid = abs(ok + ng) // 2
          if mid * n <= N:
              ok = mid
          else:
              ng = mid
      return ng
  
  
  N, K = list(map(int, input().split()))
  MOD = 10**9 + 7
  
  L = []
  t = 1
  n = N
  while t < N:
      L.append(t)
      t = hersCode(t, N, N // t, N)
  
  D = [0] * len(L)
  L.append(N + 1)
  for i in range(len(L) - 1):
      D[i] = (L[i + 1] - L[i]) % MOD
  
  DP = [[0] * (len(D)) for _ in range(K)]
  for i in range(len(D)):
      DP[0][i] = D[i]
  
  for i in range(1, K):
      S = [0] * len(D)
      S[0] = DP[i - 1][0]
      for j in range(1, len(D)):
          S[j] = S[j - 1] + DP[i - 1][j]
      for j in range(len(D)):
          DP[i][j] = S[-1 - j] * D[j] % MOD
  
  print(sum(DP[K - 1]) % MOD)
  
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"}]