#include <bits/stdc++.h>
using namespace std;
const int maxl = 2 * 1000 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
int dp[maxl][maxl];
int n, k;
int ans;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int j = 2; j < maxl; j++)
    for (int i = 1; i < maxl; i++)
      for (int l = 1; i * l < maxl; l++)
        dp[j][i] += dp[j - 1][i * l], dp[j][i] %= mod;
  for (int i = 1; i <= n; i++) ans += dp[k][i], ans %= mod;
  printf("%d\n", ans);
}
