#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, n, m = 1000000007, k;
int main() {
  cin >> n >> k;
  long dp[k + 1][n + 1];
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) {
    dp[1][i] = 1;
  }
  vector<long long> arr[n + 2];
  for (int i = 1; i <= n; i++) {
    for (int x = 1; (long long)x * x <= i; x++) {
      if (i % x == 0) {
        arr[i].push_back(x);
        if (i / x != x) arr[i].push_back(i / x);
      }
    }
  }
  for (int i = 2; i <= k; i++) {
    for (int x = 1; x <= n; x++) {
      for (int l = 0; l < arr[x].size(); l++) {
        dp[i][x] += dp[i - 1][arr[x][l]];
        dp[i][x] = dp[i][x] % m;
      }
    }
  }
  a = 0;
  for (int i = 1; i <= n; i++) {
    a += dp[k][i];
    a = a % m;
  }
  cout << a;
}
