#include <bits/stdc++.h>
using namespace std;
const int MX = 2001;
vector<int> v[MX];
long long dp[MX][MX], MOD = 1e9 + 7;
int main() {
  int n, k;
  for (int i = 1; i <= MX; i++) v[i].push_back(1);
  for (int i = 2; i <= MX; i++)
    for (int j = i; j <= MX; j += i) v[j].push_back(i);
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 2; i <= k; i++)
    for (int j = 1; j <= n; j++)
      for (int z = 0; z < v[j].size(); z++)
        dp[i][j] += (dp[i - 1][v[j][z]] % MOD), dp[i][j] %= MOD;
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += (dp[k][i] % MOD), ans %= MOD;
  cout << ans;
}
