#include <bits/stdc++.h>
using namespace std;
bool cmpManh(const std::pair<long long, long long>& l,
             const std::pair<long long, long long>& r) {
  return ((llabs(l.first) + llabs(l.second)) <
          (llabs(r.first) + llabs(r.second)));
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
const int N = 2001;
const int mod = 1e9 + 7;
int dp[N][N] = {0};
int main(void) {
  int n;
  scanf("%d", &n);
  int K;
  scanf("%d", &K);
  for (int i = 1; i <= n; ++i) {
    dp[1][i] = 1;
  }
  for (int l = 2; l <= K; ++l) {
    for (int i = 1; i <= n; ++i) {
      for (int j = i; j <= n; j += i) {
        dp[l][j] = (dp[l][j] + dp[l - 1][i]) % mod;
      }
    }
  }
  long long int ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans = (ans + dp[K][i] % mod) % mod;
  }
  printf("%lld\n", ans % mod);
  return (0);
}
