#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int n, k;
long long dp[2001][2001];
long long calc(int idx, int currentNumber) {
  if (idx == k) {
    return 1;
  }
  long long &ret = dp[idx][currentNumber];
  if (ret != -1) {
    return ret;
  }
  ret = 0;
  for (int num = currentNumber; num <= n; num += currentNumber) {
    ret += calc(idx + 1, num);
    ret %= MOD;
  }
  return ret;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += calc(1, i);
    ans %= MOD;
  }
  cout << ans;
  return 0;
}
