#include <bits/stdc++.h>
using namespace std;
long long solver(int n, int l, int prev, long long **dp) {
  long long count = 0;
  if (l == 0) {
    return 1;
  }
  if (dp[prev][l] != -1) {
    return dp[prev][l];
  }
  for (int i = 1; i <= n; i++) {
    if (i * prev > n) {
      break;
    }
    count =
        ((count % 1000000007) + (solver(n, l - 1, prev * i, dp) % 1000000007)) %
        1000000007;
  }
  dp[prev][l] = count;
  return count;
}
int main() {
  int n, l;
  cin >> n >> l;
  long long count = 0;
  long long **dp = new long long *[n + 1];
  for (int i = 0; i <= n; i++) {
    dp[i] = new long long[l + 1];
    for (int j = 0; j <= l; j++) {
      dp[i][j] = -1;
    }
  }
  for (int i = 1; i <= n; i++) {
    count = ((count % 1000000007) + (solver(n, l - 1, i, dp) % 1000000007)) %
            1000000007;
    ;
  }
  cout << count << endl;
  for (int i = 0; i < n; i++) {
    delete[] dp[i];
  }
  delete[] dp;
  return 0;
}
