#include <bits/stdc++.h>
using namespace std;
const int maxn = INT_MAX;
const int N = 2005;
const int mod = 1e9 + 7;
int num, y, temp, ans, k, m, n, i, j, h, f, dp[N][N], dp2[N], minn, ma, sum, t;
int a[N], b[N];
bool x;
char st[105];
map<char, long long> s;
int main() {
  cin >> n >> k;
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= n; i++) dp[1][i] = 1;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= n; j++)
      for (h = j; h <= n; h += j) {
        dp[i][h] = (dp[i][h] + dp[i - 1][j]) % mod;
      }
  sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += dp[k][i];
    sum %= mod;
  }
  cout << sum << endl;
  return 0;
}
