#include <cstddef>
#include <cstdint>
#include <vector>

namespace null_null {

using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using usize = std::size_t;

const int MOD = 1e9 + 7;

template <typename T>
std::vector<T> make_v(usize a) { return std::vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(usize a, Ts... ts) {
  return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename std ::enable_if<std::is_class<T>::value != 0>::type
fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename T, typename V>
inline void chmin(T &a, V b) {
  if (a > b) a = b;
}
template <typename T, typename V>
inline void chmax(T &a, V b) {
  if (a < b) a = b;
}

} // namespace null_null

#include <istream>
#include <ostream>

template <std::int_fast64_t mod>
struct ModInt {
  using i64 = std::int_fast64_t;
  i64 x;

  ModInt() : x(0) {}
  ModInt(i64 y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      std::swap(a -= t * b, b);
      std::swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(i64 n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend std::istream &operator>>(std::istream &is, ModInt &a) {
    i64 t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
};

#include <algorithm>
#include <iostream>
#include <utility>

namespace null_null {

void main_() {
  using modint = ModInt<MOD>;
  usize N, K;
  std::cin >> N >> K;

  static modint num[111000] = {};
  usize iter = 0;
  for (usize i = 1; i <= N;) {
    usize j = N / i;

    if (i <= j) {
      num[iter++] = 1;
      i++;
    } else {
      num[iter++] = N / j - i + 1;
      i = N / j + 1;
    }
  }

  static modint dp[110][111000] = {};
  dp[0][0] = 1;

  for (usize k = 0; k < K; k++) {
    static modint sum[111000] = {};
    for (usize i = 0; i <= iter; i++) sum[i + 1] = sum[i] + dp[k][i];
    for (usize i = 0; i < iter; i++) dp[k + 1][i] = sum[iter - i] * num[i];
  }

  modint res = 0;
  for (usize i = 0; i <= iter; i++) res += dp[K][i];

  std::cout << res << std::endl;
}

} // namespace null_null

int main() {
  null_null::main_();
  return 0;
}


Measured memory_bytes: 97408