#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const int mod = 1e9 + 7;
int n, k, memo[N][N];
int dp(int pos, int val) {
  if (val > n) return 0;
  if (pos == k - 1) {
    return 1;
  }
  if (memo[pos][val] != -1) return memo[pos][val];
  int ans = 0;
  for (int i = val; i <= n; i += val) {
    ans += dp(pos + 1, i);
    ans %= mod;
  }
  return memo[pos][val] = ans;
}
int main() {
  scanf("%d %d", &n, &k);
  memset(memo, -1, sizeof memo);
  int ANS = 0;
  for (int i = 1; i <= n; i++) {
    ANS += dp(0, i);
    ANS %= mod;
  }
  printf("%d\n", ANS);
  return 0;
}
