#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  long long dp[n + 1];
  int mod = 1000000007;
  dp[0] = 0;
  vector<int> devisor[2001];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j < i; j++) {
      if (i % j == 0) {
        devisor[i].push_back(j);
      }
    }
  }
  for (int i = 1; i <= n; i++) dp[i] = 1;
  for (int ki = 2; ki <= k; ki++) {
    for (int m = n; m >= 1; m--) {
      for (int di = 0; di < (int)devisor[m].size(); di++) {
        dp[m] += dp[devisor[m][di]];
        dp[m] %= mod;
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[i];
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}
