#include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
inline void solve() {
  int n, k;
  cin >> n >> k;
  vector<vector<int>> dp(k, vector<int>(n, 1));
  for (int i = 1; i < k; i++) {
    for (int j = 0; j < n; j++) {
      dp[i][j] = 0;
      for (int l = j; l < n; l += (j + 1)) {
        dp[i][j] += dp[i - 1][l];
        dp[i][j] %= md;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans += dp[k - 1][i];
    ans %= md;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
