#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 100;
const int p = 1e9 + 7;
long long dp[N][N];
int main() {
  int n, k;
  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++) {
      int x = 1;
      while (j * x <= n) {
        dp[i][j * x] += dp[i - 1][j];
        dp[i][j * x] %= p;
        x++;
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[k][i];
    ans %= p;
  }
  cout << ans;
}
