#include <bits/stdc++.h>
using namespace std;
void fn(vector<vector<int>>& div, int n) {
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++)
      if (j % i == 0) div[i].push_back(j);
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<vector<int>> div(n + 1, vector<int>());
  fn(div, n);
  vector<vector<long long>> dp(k + 1, vector<long long>(n + 1, 0));
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 2; i <= k; i++)
    for (int j = 1; j <= n; j++)
      for (auto d : div[j]) dp[i][j] = (dp[i][j] + dp[i - 1][d]) % 1000000007;
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans + dp[k][i]) % 1000000007;
  cout << ans << endl;
  return 0;
}
