#include <bits/stdc++.h>
using namespace std;
long long ans = 0, n, k;
long long memo[2001][2001];
long long solve(int last, int idx) {
  long long c = 0;
  if (memo[last][idx] > 0) return memo[last][idx];
  if (idx == k) return 1;
  for (int i = last; i <= n; i += last)
    c = (c + solve(i, idx + 1)) % 1000000007;
  memo[last][idx] = c;
  return c;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  cout << solve(1, 0) % 1000000007;
  return 0;
}
