#include <bits/stdc++.h>
using namespace std;
const long long N = 2 * 1000 + 19, K = 2 * 1000 + 19,
                mod = 1000 * 1000 * 1000 + 7;
long long dp[N][K], n, k, ans;
vector<long long> vec[N];
void prep();
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  prep();
  dp[0][1] = 1;
  for (long long i = 1; i <= k; i++)
    for (long long j = 1; j <= n; j++)
      for (auto o : vec[j]) dp[i][j] = (dp[i][j] + dp[i - 1][o]) % mod;
  for (long long i = 0; i <= n; i++) ans = (ans + dp[k][i]) % mod;
  cout << ans;
  return 0;
}
void prep() {
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= i; j++)
      if (i % j == 0) vec[i].push_back(j);
}
