#include <bits/stdc++.h>
using namespace std;
int D[2005][2005], N, K;
void precalc() {
  for (int i = 1; i <= N; i++) D[i][1] = 1;
  for (int l = 1; l <= K; l++) {
    for (int x = 0; x <= N; x++) {
      for (int divideby = 1; divideby * divideby <= x; divideby++) {
        if (x % divideby == 0) {
          D[x][l] += D[x / divideby][l - 1];
          D[x][l] %= 1000000007;
          if (divideby * divideby != x) {
            D[x][l] += D[divideby][l - 1];
            D[x][l] %= 1000000007;
          }
        }
      }
    }
  }
}
int main() {
  scanf("%d %d", &N, &K);
  precalc();
  int sol = 0;
  for (int i = 0; i <= N; i++) {
    sol = sol + D[i][K];
    sol %= 1000000007;
  }
  printf("%d\n", sol);
  return 0;
}
