#include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[2005][2005];
int solve(int i, int A) {
  if (i == k) {
    return 1;
  }
  if (dp[i][A] != -1) return dp[i][A];
  if (i == 0) {
    int res = 0;
    for (int j = 1; j <= n; j++) {
      res = ((long long int)res + solve(i + 1, j)) % 1000000007;
    }
    return dp[i][A] = res;
  } else {
    int res = 0;
    for (int j = 1; (long long int)j * A <= (long long int)n; j++) {
      res = ((long long int)res + solve(i + 1, j * A)) % 1000000007;
    }
    return dp[i][A] = res;
  }
}
int main() {
  while (scanf("%d %d", &n, &k) != EOF) {
    memset(dp, -1, sizeof dp);
    printf("%d\n", solve(0, 0));
  }
  return 0;
}
