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