#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10000 + 10;
const int inf = 522133279;
const int mod = 1000000007;
long long dp[2010][2010];
int main() {
  dp[0][1] = 1;
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= n; j++)
      for (int kk = 1; kk * j <= n; kk++)
        dp[i][kk * j] = (dp[i][kk * j] + dp[i - 1][j]) % mod;
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans + dp[k][i]) % mod;
  cout << ans << endl;
  return 0;
}
