#include <bits/stdc++.h>
using namespace std;
int c[2005];
int dp[2005][2005];
void sieve() {
  c[1] = 1;
  for (int i = 2; i <= sqrt(2005); i++) {
    if (c[i] == 0) {
      c[i] = i;
      for (int j = i * 2; j <= 2005; j += i) {
        if (c[j] == 0) {
          c[j] = i;
        }
      }
    }
  }
}
int comb(int val, int k) {
  if (k == 1) {
    return 1;
  }
  if (dp[val][k] != -1) {
    return dp[val][k] % 1000000007;
  }
  long long cc = 0;
  long long h = val;
  cc = (cc % 1000000007 + comb(val, k - 1) % 1000000007) % 1000000007;
  while (val != 1) {
    val = val / c[val];
    cc = (cc % 1000000007 + comb(val, k - 1) % 1000000007) % 1000000007;
  }
  return dp[h][k] = cc;
}
int main() {
  memset(c, 0, sizeof(c));
  sieve();
  memset(dp, 0, sizeof(dp));
  long long n, k;
  cin >> n >> k;
  long long count = 0;
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == 1) {
        dp[i][j] = 1;
      } else {
        for (int k = j; k <= n; k += j) {
          dp[i][k] =
              (dp[i][k] % 1000000007 + dp[i - 1][j] % 1000000007) % 1000000007;
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    count = (count % 1000000007 + dp[k][i] % 1000000007) % 1000000007;
  }
  cout << count << endl;
}
