#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 5, MAXM = 1e4 + 5, MAXK = 1e3 + 5, INF = 1e9 + 7,
                P = 1e9 + 7;
long long d[2222][2222];
void solve() {
  long long n, a, b, k, cnt = 0;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    d[1][i] = 1;
  }
  for (int i = 2; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= sqrt(j); k++) {
        if (j % k == 0) {
          d[i][j] += d[i - 1][j / k];
          if (k != j / k) {
            d[i][j] += d[i - 1][k];
          }
        }
      }
      d[i][j] = (d[i][j] + P) % P;
    }
  }
  for (int i = 1; i <= n; i++) {
    cnt += d[k][i];
  }
  cout << cnt % P;
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
}
