#include <bits/stdc++.h>
using namespace std;
long long n, k, mod = 1000000007, dp[2010][2010];
long long solve(long long num, long long x) {
  long long i;
  if (x == k) return 1;
  if (dp[num][x] != -1) return dp[num][x];
  long long res = 0;
  for (i = 1; (i * num) <= n; i++) {
    res += solve(num * i, x + 1) % mod;
  }
  return dp[num][x] = (res % mod);
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  cout << solve(1, 0);
  return 0;
}
