#include <bits/stdc++.h>
using namespace std;
int mod = (int)1e9 + 7;
int mem[2001][2001];
int N;
int K;
int dp(int n, int len) {
  if (len == K) {
    return 1;
  }
  int &ret = mem[n][len];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = n; i <= N; i += n) {
    ret += dp(i, len + 1) % mod;
    ret %= mod;
  }
  return ret;
}
int main() {
  cin >> N >> K;
  memset(mem, -1, sizeof(mem));
  int sum = 0;
  for (int i = 1; i <= N; i++) {
    sum += dp(i, 1);
    sum %= mod;
  }
  cout << sum << "\n";
}
