#include <bits/stdc++.h>
using namespace std;
long long dp[2001][2001];
const long long MOD = 1000000007;
int main() {
  long long n, k;
  cin >> n >> k;
  memset(dp, 0, sizeof(dp));
  for (long long j = 1; j <= n; j++) dp[1][j] = 1;
  for (long long i = 1; i <= k; i++) dp[i][n] = 1;
  for (long long j = n - 1; j >= 1; j--) {
    for (long long i = 2; i <= k; i++) {
      long long m = 1;
      while (m * j <= n) {
        dp[i][j] = (dp[i][j] + dp[i - 1][m * j]) % MOD;
        m++;
      }
    }
  }
  long long ans = 0;
  for (long long j = 1; j <= n; j++) ans = (ans + dp[k][j]) % MOD;
  cout << ans << endl;
  return 0;
}
