#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */

template <std::uint_fast64_t Modulus>
class modint {
  using u64 = std::uint_fast64_t;

 public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept
      : a(x % Modulus) {
  }
  constexpr u64 &value() noexcept {
    return a;
  }
  constexpr const u64 &value() const noexcept {
    return a;
  }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(const modint rhs) noexcept {
    return *this *= ~rhs;
  }
  constexpr modint operator^(u64 exp) const noexcept {
    modint v = 1, x = *this;
    while (exp) {
      if (exp & 1) {
        v *= x;
      }
      x *= x;
      exp >>= 1;
    }
    return v;
  }
  constexpr modint operator~() const noexcept {
    return *this ^ (Modulus - 2);
  }
};

using mint = modint<1000000007>;

template <class T>
vector<T> sumup(const vector<T> &a) {
  int N = a.size();
  vector<T> res(N + 1);
  for (int i = 0; i < N; i++) res[i + 1] = res[i] + a[i];
  return res;
}

int main() {
#ifdef DEBUG
  ifstream ifs("in.txt");
  cin.rdbuf(ifs.rdbuf());
#endif
  int N, K;
  while (cin >> N >> K) {
    int S = sqrt(N);
    vector<mint> pre(S + 1, mint(0)), dp(S + 1, mint(0));
    pre[1] = 1;
    for (int x = 1; x <= S; x++) dp[x] = 1;
    for (int t = 2; t <= K; t++) {
      vector<mint> weightedPre = pre;
      for (int x = 1; x <= S; x++) weightedPre[x] = weightedPre[x] * (N / x);
      auto dpSum = sumup(dp);
      auto preSum = sumup(pre);
      auto weightedPreSum = sumup(weightedPre);
      vector<mint> ndp(S + 1, mint(0));
      for (int x = 1; x <= S; x++) {
        ndp[x] += dpSum[min(S, N / x) + 1];
        if (S < N / x) {
          int divisor = N / x;
          int e = min(S + 1, N / divisor + 1);
          ndp[x] += preSum[e] * (N / x - S);
          ndp[x] += (weightedPreSum[S + 1] - weightedPreSum[e]) - (preSum[S + 1] - preSum[e]) * S;
        }
      }
      pre = dp;
      dp = ndp;
    }
    mint res = 0;
    for (int x = 1; x <= S; x++) res += dp[x];
    for (int x = 1; x <= S; x++) {
      int coef = max(0, N / x - S);
      res += pre[x] * coef;
    }
    cout << res.a << endl;
  }
  return 0;
}


Measured memory_bytes: 2032