#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 10;
const int mod = 1e9 + 7;
long long dp[maxn][maxn];
int main() {
  int n, k;
  memset(dp, 0, sizeof(dp));
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 2; i <= k; i++)
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k * k <= j; k++) {
        if (j % k == 0) {
          if (k * k == j)
            dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
          else
            dp[i][j] = (dp[i][j] + dp[i - 1][k] + dp[i - 1][j / k]) % mod;
        }
      }
    }
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans + dp[k][i]) % mod;
  printf("%I64d\n", ans);
  return 0;
}
