#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int INF = 1e18;
const int N = 21;
long long int n, k;
long long int dp[2001][2001];
long long int foo(long long int cn, long long int curr) {
  if (curr > n) return 0;
  if (cn == k) {
    return 1;
  }
  if (dp[cn][curr] != -1) return dp[cn][curr];
  long long int res = 0;
  for (int i = curr; i <= n; i += curr) {
    res = (res + foo(cn + 1, i)) % mod;
  }
  return dp[cn][curr] = res % mod;
}
void solve(int t) {
  cin >> n >> k;
  long long int ans = 0;
  memset(dp, -1, sizeof(dp));
  cout << foo(0, 1) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
}
