#include <bits/stdc++.h>
using namespace std;
int const N = 2000 + 100, MOD = 1e9 + 7;
int n, k;
long long dp[N + 2000][N + 2000], an;
vector<int> g[N + 2000];
long long go(int current, int depth) {
  long long &ret = dp[current][depth];
  if (ret + 1) return ret;
  if (depth == k) return 1;
  ret = 0;
  for (int i = 0; i < g[current].size(); ++i) {
    int currentNode = g[current][i];
    ret += go(currentNode, depth + 1) % MOD;
  }
  return ret % MOD;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (!(i % j)) g[i].push_back(j);
  memset(dp, -1, sizeof dp);
  for (int i = 1; i <= n; ++i) {
    an = (an + go(i, 1)) % MOD;
  }
  cout << an % MOD;
}
