#include <bits/stdc++.h>
using namespace std;
int n, k;
long long dp[2001][2001];
int main() {
  while (cin >> n >> k) {
    memset(dp, 0LL, sizeof dp);
    for (int i = 1; i <= n; ++i) dp[k][i] = 1LL;
    for (int j = k - 1; j >= 0; --j)
      for (int i = 1; i <= n; ++i)
        for (int m = 1; i * m <= n; ++m)
          dp[j][i] = (dp[j][i] + dp[j + 1][i * m]) % 1000000007;
    cout << dp[0][1] << endl;
  }
  return 0;
}
