#include <bits/stdc++.h>
using namespace std;
int dp[2010][2010];
int n, k;
vector<vector<int> > del(2010);
void calc() {
  int i, j;
  for (j = 1; j <= n; j++) {
    int targ = sqrt(j);
    for (i = 1; i <= targ; i++) {
      if (j % i == 0) {
        del[j].push_back(i);
        if (j / i != i) {
          del[j].push_back(j / i);
        }
      }
    }
  }
}
int solve() {
  int curdel = 0, i, j, t;
  for (j = 0; j < 2010; j++)
    for (i = 0; i < 2010; i++) dp[j][i] = 0;
  for (j = 1; j <= n; j++) dp[j][1] = 1;
  for (j = 2; j <= k; j++) {
    for (i = 1; i <= n; i++) {
      for (t = 0; t < del[i].size(); t++) {
        curdel = del[i][t];
        dp[i][j] = (dp[i][j] + dp[i / curdel][j - 1]) % 1000000007;
      }
    }
  }
  int ans = 0;
  for (j = 1; j <= n; j++) ans = (ans + dp[j][k]) % 1000000007;
  return ans;
}
int main() {
  int i, j, m;
  cin >> n >> k;
  calc();
  cout << solve();
}
