#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
const int N = 2e3 + 1;
int dp[N][N];
int main() {
  int n, k;
  while (~scanf("%d %d", &n, &k)) {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; ++i) {
      dp[i][0] = 1;
    }
    for (int i = 0; i < k - 1; ++i) {
      for (int pre = 1; pre <= n; ++pre) {
        for (int j = pre; j <= n; j += pre) {
          dp[j][i + 1] = (dp[j][i + 1] + dp[pre][i]) % mod;
        }
      }
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
      ans = ans + dp[i][k - 1];
      ans %= mod;
    }
    cout << ans << endl;
  }
}
