#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int sz = 3e5 + 10;
const ll mod = 1e9 + 7;
ll dp[2005][2005], ans;
int n, k;
int rec(int i, int j) {
  if (i > n) return 0;
  if (j == k - 1) return 1;
  ll &ret = dp[i][j];
  if (~ret) return ret;
  ret = 0;
  for (int h = i; h <= n; h += i) {
    ret += rec(h, j + 1);
    if (ret >= mod) ret -= mod;
  }
  return ret;
}
int main() {
  while (scanf("%d %d", &n, &k) == 2) {
    memset(dp, -1, sizeof dp);
    ans = 0;
    for (int i = 1; i <= n; i++) {
      ans += rec(i, 0);
      if (ans >= mod) ans -= mod;
    }
    cout << ans << "\n";
    cerr << "-----\n";
  }
  return 0;
}
