#include <bits/stdc++.h>
using namespace std;
long long n, k, dp[2003][2003], ans;
const long long modu = 1000000007;
int main() {
  scanf("%lld%lld", &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] + dp[i - 1][j / k]) % modu;
          else
            dp[i][j] = (dp[i][j] + dp[i - 1][k]) % modu;
        }
    }
  }
  for (int i = 1; i <= n; ++i) ans = (ans + dp[k][i]) % modu;
  printf("%lld", ans);
  return 0;
}
