#include <bits/stdc++.h>
using namespace std;
const int MOD = int(1e9 + 7);
int dp[2005][2005];
int main() {
  int N, K, ans, lim[2005];
  long long tmp;
  for (int i = (1); (i) <= int(2000); ++i) lim[i] = (int)floor(sqrt(i));
  while (~scanf("%d %d", &N, &K)) {
    for (int n = (1); (n) <= int(N); ++n) dp[n][1] = 1;
    for (int k = (2); (k) <= int(K); ++k)
      for (int n = (1); (n) <= int(N); ++n) {
        tmp = 0;
        for (int x = (1); (x) <= int(lim[n]); ++x)
          if (n % x == 0) tmp += dp[x][k - 1] + dp[n / x][k - 1];
        if (n == lim[n] * lim[n]) tmp -= dp[lim[n]][k - 1];
        dp[n][k] = tmp % MOD;
      }
    ans = 0;
    for (int i = (1); (i) <= int(N); ++i) ans = (ans + dp[i][K]) % MOD;
    printf("%d\n", ans);
  }
  return 0;
}
