#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int Max_dp = 2000 + 5;
int dp[Max_dp][Max_dp];
long long answer;
int main() {
  int n, k;
  cin >> n >> k;
  dp[0][1] = 1;
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      answer = 0;
      for (int l = 1; l * l <= j; l++) {
        if (j % l == 0) {
          answer = (answer + dp[i - 1][l]) % mod;
          if (l * l != j) {
            answer = (answer + dp[i - 1][j / l]) % mod;
          }
        }
      }
      dp[i][j] = answer % mod;
    }
  }
  long long javab = 0;
  for (int i = 1; i <= n; i++) {
    javab = (javab + dp[k][i]) % mod;
  }
  cout << javab << endl;
  return 0;
}
