#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 2;
int n, k;
long long int dp[2005][2005];
const int MOD = 1E9 + 7;
long long int rec(int prev, int cnt) {
  if (cnt == k) {
    return 1;
  }
  long long int &ret = dp[prev][cnt];
  if (~ret) return ret;
  ret = 0;
  for (int i = prev; i <= n; i += prev) {
    ret = (ret % MOD + rec(i, cnt + 1) % MOD);
    ret = ret % MOD;
  }
  return ret;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  long long int x = rec(1, 0);
  cout << x << endl;
}
