#include <bits/stdc++.h>
using namespace std;
long long int n, t, mod = 1e9 + 7, k, h;
long long int c = 0;
int a[10];
long long int dp[2010][2010];
long long int solve(long long int k, long long int i) {
  if (k == 1) return 1;
  dp[k][i] = 0;
  for (int j = i; j <= n; j += i) {
    if (dp[k - 1][j] != -1) {
      dp[k][i] = (dp[k][i] + dp[k - 1][j]) % mod;
    } else {
      dp[k][i] = (dp[k][i] + solve(k - 1, j)) % mod;
    }
  }
  return dp[k][i] % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  if (k == 1) {
    cout << n << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    dp[k][i] = 0;
    for (int j = i; j <= n; j += i) {
      if (dp[k - 1][j] != -1)
        dp[k][i] = (dp[k][i] + dp[k - 1][j]) % mod;
      else {
        dp[k][i] = (dp[k][i] + solve(k - 1, j)) % mod;
      }
    }
    c = (c + dp[k][i]) % mod;
  }
  cout << c << endl;
}
