#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 10;
const unsigned long long MOD = 1e9 + 7;
unsigned long long n, k, f[N], p[N];
int main() {
  cin >> n >> k;
  memset(p, 0, sizeof(p));
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= n; i++) p[i] = 1;
  for (int t = 2; t <= k; t++) {
    for (int a = 1; a <= n; a++) {
      f[a] = 0;
      for (int j = 1; j <= (n / a); j++) {
        f[a] += p[j * a];
        f[a] %= MOD;
      }
    }
    for (int a = 1; a <= n; a++) p[a] = f[a];
  }
  unsigned long long ans = 0;
  for (int a = 1; a <= n; a++) {
    ans += p[a];
    ans %= MOD;
  }
  cout << ans << '\n';
  return 0;
}
