#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
using namespace std;
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*
下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
#define MAXN 200000
int dp[101][MAXN];
int dpS[MAXN];
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N, K;
  cin >> N >> K;
  int sqN = sqrt(N);
  // 1--- sqN ,N/1
  REP(i, sqN) dp[0][i + 1] = 1;
  REP(i, sqN) {
    int val1 = max(sqN + 1ll, (int)floor(N * 1. / (i + 2)) + 1);
    int val0 = floor(N * 1. / (i + 1));
    if (val1 <= val0) dp[0][2 * sqN - i] = val0 - val1 + 1;
    // DUMP(i + 1, val1, val0);
  }

  // PRINTARR(&dp[0][0], &dp[0][2 * sqN + 2]);
  int sum = 0;
  REP(i, 2 * sqN + 1) { dp[0][i] %= MOD, sum += dp[0][i]; }
  assert(sum == N);
  // PRINTARR(&dp[0][0], &dp[0][2 * sqN + 1]);
  REP(i, K - 1) {
    dpS[0] = 0;
    REP(j, 2 * sqN + 1) {
      dpS[j + 1] = dp[i][j] + dpS[j];
      dpS[j + 1] %= MOD;
    }
    // sqN+1  sqN 2*sqN+1 からsqN+2
    REPI(j, sqN) { dp[i + 1][j] = dpS[2 * sqN + 2 - j]; }
    REP(j, sqN) {
      int val = (sqN + 1 + j);
      //      int index = floor(N * 1. / val);
      // 31 6
      dp[i + 1][val] = (dpS[sqN + 1 - j] * dp[0][val]) % MOD;
    }
    assert(dp[i][0] == 0);
    // 0 1 2
    //
    // PRINTARR(&dp[i + 1][0], &dp[i + 1][2 * sqN + 1]);
  }
  PRINTARR(&dp[K - 1][0], &dp[K - 1][2 * sqN + 1]);
  int ans = 0;
  REP(i, 2 * sqN + 1) {
    ans += dp[K - 1][i];
    ans %= MOD;
  }
  print(ans);
}

Measured memory_bytes: 155904