#include <bits/stdc++.h>
using namespace std;
const int max_n = 2000 + 3;
long long dyn[max_n], last[max_n];
const int mod = 1e9 + 7;
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = k - 1; i >= 0; i--) {
    for (int j = 1; j < n + 1; j++) last[j] = dyn[j];
    for (int j = 1; j < n + 1; j++)
      if (i == k - 1)
        dyn[j] = 1;
      else {
        dyn[j] = 0;
        for (int q = 1; j * q <= n; q++) dyn[j] = (dyn[j] + last[j * q]) % mod;
      }
  }
  long long ans = 0;
  for (int i = 1; i < n + 1; i++) ans = (dyn[i] + ans) % mod;
  cout << ans << endl;
  return 0;
}
