#include <bits/stdc++.h>
using namespace std;
long long table[2001][2001];
int mod = 1000000007;
int n, k;
long long getres(int nn, int kk) {
  if (kk == 0) return 1;
  if (table[nn][kk] >= 0) return table[nn][kk];
  long long res = 0;
  int next = nn;
  while (next <= n) {
    res += getres(next, kk - 1);
    res %= mod;
    next += nn;
  }
  table[nn][kk] = res;
  return res;
}
int main() {
  cin >> n >> k;
  memset(table, -1, sizeof(table));
  long long res = 0;
  for (int i = 1; i <= n; i++) {
    res += getres(i, k - 1);
    res %= mod;
  }
  cout << res;
  return 0;
}
