#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int dp[2002][2002];
long long solve(int n, int k) {
  if (dp[n][k] != 0) return dp[n][k];
  if (n == 1) return 1;
  if (k == 1) return n;
  long long res = 0;
  for (int i = 1; i <= n; i++) res = (res + solve(n / i, k - 1)) % MOD;
  return dp[n][k] = res;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  printf("%d\n", solve(n, k));
  return 0;
}
