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