#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int dp[2005][2005];
int n, k, ans;
int main() {
  int i, j, p;
  while (~scanf("%d%d", &n, &k)) {
    memset(dp, 0, sizeof dp);
    for (i = 1; i <= n; ++i) dp[1][i] = 1;
    for (i = 2; i <= k; ++i)
      for (j = 1; j <= n; ++j)
        for (p = j; p <= n; p += j) dp[i][p] = (dp[i][p] + dp[i - 1][j]) % MOD;
    ans = 0;
    for (i = 1; i <= n; ++i) ans = (ans + dp[k][i]) % MOD;
    printf("%d\n", ans);
  }
  return 0;
}
