#include <bits/stdc++.h>
using namespace std;
int n, k;
int memo[2002][2002];
long long dp(int cur, int lo) {
  if (lo == k) return 1;
  int& ret = memo[cur][lo];
  if (ret != -1) return ret;
  ret = 0;
  int tmp = cur;
  while (tmp <= n) {
    ret = (ret + dp(tmp, lo + 1)) % 1000000007;
    tmp += cur;
  }
  return ret;
}
int main() {
  cin >> n >> k;
  memset(memo, -1, sizeof memo);
  long long ans = 0;
  for (int i = 1; i <= n; ++i) ans = (ans + dp(i, 1)) % 1000000007;
  cout << ans;
  return 0;
}
