#include <bits/stdc++.h>
using namespace std;
long long a[2005][2005];
const long long mod = 1e9 + 7;
int main() {
  long n, z;
  cin >> n >> z;
  for (int i = 1; i <= n; i++) a[1][i] = 1;
  for (int i = 2; i <= z; i++)
    for (int j = 1; j <= n; j++) {
      a[i][j] = 0;
      for (int k = 1; k * k <= j; k++) {
        if (j % k) continue;
        if (j / k == k) {
          a[i][j] = (a[i][j] + a[i - 1][k]) % mod;
        } else {
          a[i][j] = (a[i][j] + a[i - 1][k] + a[i - 1][j / k]) % mod;
        }
      }
    }
  long res = 0;
  for (int i = 1; i <= n; i++) {
    res += a[z][i];
    res %= mod;
  }
  cout << res;
  return 0;
}
