#include <bits/stdc++.h>
using namespace std;
int n, k;
long long mem[2005][2005];
long long rec(int index, int prev) {
  long long &ways = mem[index][prev];
  if (ways != -1) return ways;
  if (index == k) return 1;
  ways = 0;
  for (int i = 1; prev * i <= n; ++i)
    ways = (ways + (rec(index + 1, prev * i) % 1000000007) % 1000000007);
  return (ways % 1000000007);
}
int main() {
  memset(mem, -1, sizeof(mem));
  scanf("%d%d", &n, &k);
  printf("%I64d", rec(0, 1));
  return 0;
}
