#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long dp[2020][2020];
long long solve(int i, int r) {
  if (i > n) return 0;
  if (r == 0) return 1;
  if (dp[i][r] != -1) return dp[i][r];
  long long ans = 0;
  for (int j = i; j <= n; j += i) {
    ans += solve(j, r - 1);
  }
  return dp[i][r] = ans % (1000000000 + 7);
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  cout << solve(1, k) << endl;
  return 0;
}
