#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

template<unsigned P> struct ModInt {
  using M = ModInt;
  unsigned v;
  ModInt() : v(0) {}
  ModInt(auto x) : v(x >= 0 ? x % P : (P - -x % P) % P) {}
  constexpr ModInt(unsigned v, int) : v(v) {}
  static constexpr unsigned p() { return P; }
  M operator+() const { return *this; }
  M operator-() const { return {v ? P - v : 0, 0}; }
  explicit operator bool() const noexcept { return v; }
  bool operator!() const noexcept { return !(bool)*this; }
  M operator*(M r) const { return M(*this) *= r; }
  M operator/(M r) const { return M(*this) /= r; }
  M operator+(M r) const { return M(*this) += r; }
  M operator-(M r) const { return M(*this) -= r; }
  bool operator==(M r) const { return v == r.v; }
  bool operator!=(M r) const { return !(*this == r); }
  M& operator*=(M r) { v = (uint64_t)v * r.v % P; return *this; }
  M& operator/=(M r) { return *this *= r.inv(); }
  M& operator+=(M r) { if ((v += r.v) >= P) v -= P; return *this; }
  M& operator-=(M r) { if ((v += P - r.v) >= P) v -= P; return *this; }
  M inv() const {
    int a = v, b = P, x = 1, u = 0;
    while (b) {
      int q = a / b;
      swap(a -= q * b, b);
      swap(x -= q * u, u);
    }
    assert(a == 1);
    return x;
  }
  M pow(auto n) const {
    if (n < 0) return pow(-n).inv();
    M res = 1;
    for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;
    return res;
  }
  friend M operator*(auto l, M r) { return M(l) *= r; }
  friend M operator/(auto l, M r) { return M(l) /= r; }
  friend M operator+(auto l, M r) { return M(l) += r; }
  friend M operator-(auto l, M r) { return M(l) -= r; }
  friend ostream& operator<<(ostream& os, M r) { return os << r.v; }
  friend istream& operator>>(istream& is, M& r) { lint x; is >> x; r = x; return is; }
  friend bool operator==(auto l, M r) { return M(l) == r; }
  friend bool operator!=(auto l, M r) { return !(l == r); }
};
using Mint = ModInt<(unsigned)1e9 + 7>;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int k, n; cin >> k >> n, --n;
  int m = sqrt(k);
  V<Mint> dp0(m + 1), dp1(m + 1);
  for (int x = 1; x <= m; ++x) dp0[x] = 1;
  for (int c = 1; c <= m; ++c) dp1[c] = k / c - k / (c + 1);
  if (k < m * (m + 1)) dp0[m] = 0;
  while (n--) {
    for (int x = 1; x < m; ++x) dp0[x + 1] += dp0[x];
    for (int c = 1; c < m; ++c) dp1[c + 1] += dp1[c];
    V<Mint> ndp0(m + 1), ndp1(m + 1);
    for (int x = 1; x <= m; ++x) {
      ndp0[x] = dp0.back() + dp1.back() - dp1[x - 1];
    }
    for (int c = 1; c <= m; ++c) {
      ndp1[c] = dp0[c] * (k / c - k / (c + 1));
    }
    if (k < m * (m + 1)) ndp1[m] = dp0[m - 1] + dp1[m] - dp1[m - 1];
    swap(dp0, ndp0);
    swap(dp1, ndp1);
    if (k < m * (m + 1)) dp0[m] = 0;
    // cerr << "dp0(" << dp0.size() << ") = {"; for (const auto& e : dp0) cerr << e << ", "; cerr << "} (l." << __LINE__ << ")\n";
    // cerr << "dp1(" << dp1.size() << ") = {"; for (const auto& e : dp1) cerr << e << ", "; cerr << "} (l." << __LINE__ << ")\n";
  }
  Mint res = accumulate(begin(dp0), end(dp0), Mint(0));
  res += accumulate(begin(dp1), end(dp1), Mint(0));
  cout << res << '\n';
}

Measured memory_bytes: 816