#include <bits/stdc++.h>
using namespace std;
const int modul = 1e9 + 7;
int n, k, dp[2000 + 100][2000 + 100], ans;
void solve(int x, int val) {
  for (int i = val; i <= n; i += val) {
    dp[x + 1][i] += dp[x][val];
    dp[x + 1][i] %= modul;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= n; j++) {
      solve(i, j);
    }
  for (int i = 1; i <= n; i++) ans += dp[k][i], ans %= modul;
  cout << (ans + modul) % modul << endl;
  return 0;
}
