#include <bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;
long long dp[2005][2005];
int main() {
  int n, length;
  cin >> n >> length;
  vector<int> div[2005];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++)
      if (i % j == 0) div[i].push_back(j);
  }
  for (int i = 1; i <= n; i++) dp[1][i] = 1;
  for (int i = 2; i <= length; i++) {
    for (int j = 1; j <= n; j++) {
      for (int d = 0; d < div[j].size(); d++) {
        dp[i][j] = (dp[i][j] % 1000000007 + dp[i - 1][div[j][d]] % 1000000007) %
                   1000000007;
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++)
    ans = (ans % 1000000007 + dp[length][i] % 1000000007) % 1000000007;
  cout << ans % 1000000007 << endl;
  return 0;
}
