#include <bits/stdc++.h>
using namespace std;
const int M = int(1e9) + 7;
int n, m, d[2222][2222];
vector<int> v[2222];
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) d[1][i] = 1;
  for (int i = 1; i <= m; i++) d[i][1] = 1;
  for (int i = 2; i <= n; i++)
    for (int j = 1; j <= i; j++)
      if (!(i % j)) v[i].push_back(j);
  for (int i = 2; i <= m; i++)
    for (int j = 2; j <= n; j++)
      for (int k = 0; k < v[j].size(); k++) (d[i][j] += d[i - 1][v[j][k]]) %= M;
  long long ans = 0;
  for (int i = 1; i <= n; i++) (ans += d[m][i]) %= M;
  cout << ans;
}
