#include <bits/stdc++.h>
using namespace std;
long long dp[2005][2005];
vector<long long> factors(long long n) {
  vector<long long> fact;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      fact.push_back(i);
      if (i * i != n) fact.push_back(n / i);
    }
  }
  return fact;
}
vector<long long> fact[2005];
void fn() {
  for (long long i = 0; i < 2005; i++) fact[i] = factors(i);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  fn();
  long long n, k;
  cin >> n >> k;
  dp[0][1] = 1;
  for (long long pos = 1; pos < k + 1; pos++) {
    for (long long k = 1; k < n + 1; k++) {
      vector<long long> v = fact[k];
      long long cnt = 0;
      for (long long z = 0; z < v.size(); z++)
        cnt = (cnt + dp[pos - 1][v[z]]) % 1000000007;
      dp[pos][k] = cnt;
    }
  }
  long long ans = 0;
  for (long long i = 1; i < n + 1; i++) ans = (ans + dp[k][i]) % 1000000007;
  cout << ans << endl;
  return 0;
}
