#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int dp[2100][2100];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 1; i < k; i++) {
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k * j <= n; k++) {
        dp[i + 1][k * j] += dp[i][j];
        dp[i + 1][k * j] %= mod;
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[k][i];
    ans %= mod;
  }
  printf("%d\n", ans);
  return 0;
}
