#include <bits/stdc++.h>
using namespace std;
const unsigned long long mod = 1000000007LL;
unsigned long long dp[2047][2047];
int main() {
  iostream::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= k; i++) dp[i][1] = 1;
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int high = 2; high <= n; high++) {
    vector<int> divs;
    for (int i = 1; i <= high; i++)
      if (high % i == 0) divs.push_back(i);
    for (int pos = 2; pos <= k; pos++)
      for (int i = 0; i < divs.size(); i++)
        dp[pos][high] += dp[pos - 1][divs[i]], dp[pos][high] %= mod;
  }
  unsigned long long sum = 0;
  for (int i = 1; i <= n; i++) sum = (sum + dp[k][i]) % mod;
  cout << sum << endl;
  return 0;
}
