#include <bits/stdc++.h>
const long long int mod = 1000000007;
long long int n, k, lenght, s[2002][2002], last, i, j, clast, x;
void sol() {
  for (i = 2; i < 2002; i++)
    for (j = 0; j < 2002; j++) s[i][j] = 0;
  for (j = 0; j < 2002; j++) s[1][j] = 1;
  for (lenght = 2; lenght <= k; lenght++)
    for (last = 1; last <= n; last++)
      for (clast = last; clast <= n; clast += last) {
        s[lenght][last] += s[lenght - 1][clast];
        s[lenght][last] = s[lenght][last] % mod;
      }
  x = 0;
  for (last = 1; last <= n; last++) {
    x += s[k][last];
    x = x % mod;
  }
  printf("%I64d ", x);
}
int main() {
#pragma comment(linker, "/STACK:16777216")
  while (scanf("%I64d%I64d", &n, &k) != EOF) {
    sol();
  }
}
