#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
vector<int> v[2020];
long long dp[2020][2020];
long long add(long long a, long long b) {
  long long c = a + b;
  while (c >= mod) c -= mod;
  return c;
}
int main() {
  long long n, m;
  scanf("%lld %lld", &n, &m);
  long long sum = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= sqrt(i); ++j) {
      if (i % j == 0) {
        v[i].push_back(j);
        if (j * j != i) {
          v[i].push_back(i / j);
        }
      }
    }
    dp[1][i] = 1;
  }
  for (int i = 2; i <= m; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int k = 0; k < v[j].size(); ++k) {
        dp[i][j] = add(dp[i][j], dp[i - 1][v[j][k]]);
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    sum = add(dp[m][i], sum);
  }
  printf("%lld\n", sum);
}
