#include <bits/stdc++.h>
using namespace std;
int N, K;
int mod = 1000000007;
int memo[2001][2001];
vector<vector<int> > divs;
int dp(int id, int last) {
  int res = 0;
  if (id == K) return 1;
  if (last != -1 && memo[id][last] != -1) return memo[id][last];
  if (last == -1) {
    for (int k = 1; k <= N; k++) {
      res = ((res % mod) + dp(id + 1, k) % mod) % mod;
    }
  } else {
    for (int k = 0; k < divs[last].size(); k++) {
      res = ((res % mod) + dp(id + 1, divs[last][k]) % mod) % mod;
    }
  }
  return memo[id][last] = res % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> N >> K;
  memset(memo, -1, sizeof(memo));
  divs = vector<vector<int> >(2001);
  for (int k = 1; k <= N; k++)
    for (int i = 1; i <= N; i++)
      if (i % k == 0) divs[k].push_back(i);
  cout << dp(0, -1) << endl;
  return 0;
}
