#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a / gcd(a, b)) * b;
}
long long int dp[2005][2005];
long long int help(long long int n, long long int k, long long int num) {
  if (k <= 0) return 1;
  if (dp[k][num] != -1) return dp[k][num];
  long long int cnt = 0;
  for (long long int j = num; j <= n; j += num) {
    cnt = (cnt % 1000000007 + help(n, k - 1, j) % 1000000007) % 1000000007;
  }
  return dp[k][num] = cnt;
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int ans = help(n, k, 1);
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  memset(dp, -1, sizeof(dp));
  while (t--) solve();
}
