#include <bits/stdc++.h>
using namespace std;
const int N = 2002;
const int mo = 1000000007;
int n, k;
long long Ans, f[N][N];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) f[1][i] = 1;
  for (int i = 1; i < k; i++)
    for (int j = 1; j <= n; j++) {
      f[i][j] %= mo;
      for (int l = j; l <= n; l += j) f[i + 1][l] += f[i][j];
    }
  for (int i = 1; i <= n; i++) Ans += f[k][i];
  cout << Ans % mo << endl;
  return 0;
}
