#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int k;
  cin >> k;
  int arr[n];
  for (int i = 0; i < n; i++) {
    arr[i] = i + 1;
  }
  int dp[k + 1][n + 1];
  memset(dp, 0, sizeof dp);
  for (int i = 1; i <= n; i++) {
    dp[1][i] = 1;
  }
  for (int l = 1; l <= k; l++) {
    for (int i = 1; i <= n; i++) {
      for (int j = i; j <= n; j += i) {
        dp[l][i] += dp[l - 1][j];
        dp[l][i] %= 1000000007;
      }
    }
  }
  long long sum = 0;
  for (int i = 0; i <= n; i++) sum += dp[k][i];
  cout << sum % 1000000007 << "\n";
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
