#include <bits/stdc++.h>
using namespace std;
int _neg = 0;
void solve() {
  int n, k;
  cin >> n >> k;
  unsigned int dp[n + 1][k + 1];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < n + 1; ++i) dp[i][k] = 1;
  for (int i = k - 1; i >= 1; i--) {
    for (int j = 1; j < n + 1; ++j) {
      for (int l = 1; j * l <= n; l++) {
        dp[j][i] = (dp[j][i] + dp[j * l][i + 1]) % 1000000007;
      }
    }
  }
  unsigned int ret = 0;
  for (int i = 1; i < n + 1; ++i) ret = (ret + dp[i][1]) % 1000000007;
  cout << ret;
}
int main() {
  solve();
  cout << endl;
}
