#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long dp[2001][2001];
int main() {
  long long j, n, k, i, temp, sum = 0, l;
  cin >> n >> k;
  for (i = 0; i < 2001; i++) dp[0][i] = 1;
  for (i = 1; i <= k; i++) {
    for (j = 1; j <= n; j++) {
      for (l = j; l <= n; l += j) {
        dp[i][j] = (dp[i][j] + dp[i - 1][l]) % mod;
      }
    }
  }
  for (i = 1; i <= n; i++) sum = (sum + dp[k - 1][i]) % mod;
  cout << sum << endl;
  return 0;
}
