#include <bits/stdc++.h>
using namespace std;
const int maxn = 2222;
int n, k, f[maxn][maxn];
int F(int n, int k) {
  if (f[n][k] != -1) return f[n][k];
  if (k == 1 || n == 1) return f[n][k] = 1;
  int ret = 0;
  for (int i = 1; i <= (int)sqrt(n); ++i)
    if (n % i == 0) {
      ret = ((long long)ret + F(i, k - 1)) % 1000000007;
      if (i * i != n) ret = ((long long)ret + F(n / i, k - 1)) % 1000000007;
    }
  return f[n][k] = ret;
}
int main() {
  scanf("%d%d", &n, &k);
  memset(f, -1, sizeof f);
  int res = 0;
  for (int i = 1; i <= n; ++i) res = ((long long)res + F(i, k)) % 1000000007;
  printf("%d\n", res);
}
