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