#include <bits/stdc++.h>
using namespace std;
int n, k;
long long int a[2002][2002];
long long int recurr(int i, int j) {
  long long int z = -1;
  if (a[i][j] != z)
    return a[i][j];
  else {
    a[i][j] = 0;
    for (int l = i; l <= n; l += i) {
      a[i][j] += recurr(l, j - 1) % 1000000007;
      a[i][j] = a[i][j] % 1000000007;
    }
  }
  return a[i][j];
}
int main() {
  cin >> n >> k;
  memset(a, -1, sizeof(a));
  for (int i = 1; i < k + 1; i++) {
    a[n][i] = 1;
  }
  for (int i = 1; i < n + 1; ++i) {
    a[i][1] = 1;
  }
  long long int ans = 0;
  for (int i = 1; i < n + 1; ++i) {
    ans += recurr(i, k);
    ans = ans % 1000000007;
  }
  cout << ans << endl;
  return 0;
}
