#include <bits/stdc++.h>
using namespace std;
long long int t, n;
int k[2005][2005];
long long int dp(int i, int prev) {
  if (i == t) {
    long long int count = 0;
    for (int j = prev; j <= n; j++) {
      if (j % prev == 0) count = (count % 1000000007 + 1) % 1000000007;
    }
    return count % 1000000007;
  }
  long long int sum = 0;
  for (int j = prev; j <= n; j = j + prev) {
    if (k[i + 1][j] == -1) k[i + 1][j] = dp(i + 1, j) % 1000000007;
    sum = (sum % 1000000007 + k[i + 1][j] % 1000000007) % 1000000007;
  }
  return sum % 1000000007;
}
int main() {
  memset(k, -1, sizeof(k));
  cin >> n >> t;
  cout << dp(1, 1);
  return 0;
}
