#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 20;
long long n, k, dp[N][N], b = 0;
vector<int> v[N];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      if (i % j == 0) {
        v[i].push_back(j);
      }
    }
  }
  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++) {
      dp[i][j] = 0;
      for (int e = 0; e < v[j].size(); e++) {
        dp[i][j] = (dp[i][j] + dp[i - 1][v[j][e]]) % 1000000007;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    b = b + dp[k][i] % 1000000007;
  }
  cout << b % 1000000007;
  return 0;
}
