#include <bits/stdc++.h>
using namespace std;
long long dp[2100][2100];
bool v[2100][2100];
int n, k;
long long solve(long long x, long long c) {
  if (c == k) return 1;
  if (v[x][c]) return dp[x][c];
  for (int i = 1; i * x <= n; i++) {
    dp[x][c] %= 1000000007;
    dp[x][c] += solve(i * x, c + 1);
  }
  v[x][c] = true;
  return dp[x][c];
}
int main() {
  scanf("%d %d", &n, &k);
  printf("%I64d", solve(1, 0));
  return 0;
}
