#include <bits/stdc++.h>
using namespace std;
long long dp[2005][2005];
long long ns[2005];
int n, k;
long long rec(int now_at, int size) {
  if (size <= 0) return 1;
  if (now_at <= 0) return 0;
  if (dp[now_at][size] > 0) return dp[now_at][size];
  long long ans = 0;
  long long x = pow(10, 9) + 7;
  for (int j = now_at; j <= n; j += now_at) {
    ans += rec(j, size - 1) % x;
  }
  return dp[now_at][size] = ans % x;
}
int main() {
  cin >> n >> k;
  memset(ns, 0, sizeof(ns));
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) ns[i] = i;
  long long ans = rec(1, k);
  cout << ans << endl;
}
