#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 2e3 + 20;
long long f[N];
long long dp[N][N];
int main() {
  int n, k;
  while (cin >> n >> k) {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) dp[1][i] = 1;
    for (int i = 2; i <= k; i++) {
      for (int x = 1; x <= n; x++) {
        for (int y = x; y <= n; y += x) {
          dp[i][x] = (dp[i][x] + dp[i - 1][y]) % mod;
        }
      }
    }
    long long ans = 0;
    for (int x = 1; x <= n; x++) ans = (ans + dp[k][x]) % mod;
    cout << ans << endl;
  }
  return 0;
}
