#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = (long long)1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  vector<vector<long long>> dp(k + 1, vector<long long>(n + 1, 0));
  for (int i = 1; i <= n; i++) {
    dp[1][i] = 1;
  }
  for (int pos = 2; pos <= k; pos++) {
    for (int ending = 1; ending <= n; ending++) {
      for (int fact = 1; fact * fact <= ending; fact++) {
        if (fact * fact == ending && ending % fact == 0) {
          dp[pos][ending] =
              (dp[pos][ending] + dp[pos - 1][ending / fact]) % mod;
          continue;
        }
        if (ending % fact == 0) {
          dp[pos][ending] =
              (dp[pos][ending] + dp[pos - 1][ending / fact]) % mod;
          dp[pos][ending] = (dp[pos][ending] + dp[pos - 1][fact]) % mod;
        }
      }
    }
  }
  long long answer = 0;
  for (int i = 1; i <= n; i++) {
    answer = (answer + dp[k][i]) % mod;
  }
  cout << answer << '\n';
  return 0;
}
