#include <bits/stdc++.h>
using namespace std;
int n;
int pd[2010][2010];
int solve(int falta, int ult) {
  if (falta == 0) return 1;
  int& ret = pd[falta][ult];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = 1; ult * i <= n; i++) {
    ret += solve(falta - 1, ult * i);
    if (ret >= 1000000007) ret -= 1000000007;
  }
  return ret;
}
int main() {
  int k;
  cin >> n >> k;
  memset(pd, -1, sizeof pd);
  int ans = 0;
  cout << solve(k, 1) << endl;
  return 0;
}
