#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[2005][2005];
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) != EOF) {
    int i, j, k;
    memset(dp, 0, sizeof(dp));
    for (i = n; i >= 1; i--) {
      dp[i][1] = 1;
      for (j = 2; j <= m; j++) {
        for (k = i; k <= n; k += i) {
          dp[i][j] += dp[k][j - 1];
          dp[i][j] %= MOD;
        }
      }
    }
    long long ans = 0;
    for (i = 1; i <= n; i++) {
      ans += dp[i][m];
      ans %= MOD;
    }
    printf("%lld\n", ans);
  }
  return 0;
}
