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