#include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[2005][2005];
int solve(int pos, int val) {
  if (val > n) return 0;
  if (pos == k) return 1;
  if (dp[pos][val] != -1) return dp[pos][val];
  int ans = 0;
  for (int nuevo = 1;; nuevo++) {
    if ((long long)val * nuevo > n) break;
    ans += solve(pos + 1, val * nuevo);
    ans %= 1000000007;
  }
  return dp[pos][val] = ans;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  cout << solve(0, 1) << endl;
  return 0;
}
