#include <bits/stdc++.h>
using namespace std;
int n, g, m;
long long dp[2001][2001];
long long solve(int ind, int cn) {
  if (ind == m - 1) return 1;
  long long &ret = dp[ind][cn];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = 1; i * cn <= n; i++) {
    ret = (ret + solve(ind + 1, i * cn)) % 1000000007;
  }
  return ret % 1000000007;
}
int main() {
  int i, j;
  int a, b;
  cin >> n >> m;
  memset(dp, -1, sizeof dp);
  long long res = 0;
  for (i = 1; i <= n; i++) {
    res = (res + solve(0, i)) % 1000000007;
  }
  cout << res % 1000000007 << endl;
  return 0;
}
