#include <bits/stdc++.h>
using namespace std;
int n, k;
long long dp[2005][2005], ans;
const int mod = 1e9 + 7;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    dp[1][i] = 1;
  }
  for (int i = 2; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k * k <= j; k++)
        if (j % k == 0) {
          dp[i][j] += dp[i - 1][k];
          if (k * k != j) dp[i][j] += dp[i - 1][j / k];
          dp[i][j] %= mod;
        }
    }
  }
  for (int i = 1; i <= n; i++) {
    ans += dp[k][i];
    ans %= mod;
  }
  cout << ans;
}
