#include <bits/stdc++.h>
using namespace std;
long long f[2005][2005];
const int mod = (int)1e9 + 7;
int main() {
  int N, K;
  cin >> N >> K;
  long long sum = 0;
  for (int l = 1; l <= K; l++) {
    for (int d = 1; d <= N; d++) {
      if (l == 1)
        f[l][d] = 1;
      else {
        for (int i = 1; i <= sqrt(d); i++)
          if (d % i == 0) {
            f[l][d] += f[l - 1][i];
            f[l][d] %= mod;
            if (d != (i * i)) {
              f[l][d] += f[l - 1][d / i];
              f[l][d] %= mod;
            }
          }
      }
      if (l == K) sum = (sum + f[l][d]) % mod;
    }
  }
  cout << sum << endl;
}
