#include <bits/stdc++.h>
template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a; swap(a, m);
    u -= t * v; swap(u, v);
  }
  assert(m == 1);
  return u;
}
template <typename T>
class modular {
  private:
    int value;
  public:
    constexpr modular() = default;
    constexpr modular(const modular&) = default;
    constexpr modular(modular&&) = default;
    modular& operator=(const modular&) = default;
    modular& operator=(modular&&) = default;

    template <typename U>
    modular (const U& x) {value = normalize(x);}

    template <typename U>
    static auto normalize(const U& x) {
      int v = static_cast<int>(-mod() <= x && x < mod() ? x : x % mod());
      if (v < 0) v += mod();
      return v;
    }

    auto const& operator()() const { return value; }
    template <typename U>
    explicit operator U() const { return static_cast<U>(value); }
    constexpr static auto mod() { return T::value; }

    auto& operator+=(const modular& other) {
      if ((value += other.value) >= mod()) value -= mod();
      return *this;
    }
    auto& operator-=(const modular& other) {
      if ((value -= other.value) < 0) value += mod();
      return *this;
    }
    template <typename U>
    auto& operator+=(const U& other) {return *this += modular(other); }
    template <typename U>
    auto& operator-=(const U& other) {return *this -= modular(other); }
    auto operator-() const { return modular(-value); }

    template <typename U = T>
    auto operator*=(const modular& rhs) {
      return normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
    }
    auto& operator/=(const modular& other) {
      return *this *= modular(inverse(other.value, mod()));
    }
};

template <typename T> bool operator==(const modular<T>& lhs, const modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U> bool operator==(const modular<T>& lhs, U rhs) { return lhs == modular<T>(rhs); }
template <typename T, typename U> bool operator==(U lhs, const modular<T>& rhs) { return modular<T>(lhs) == rhs; }

template <typename T> bool operator!=(const modular<T>& lhs, const modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(const modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(U lhs, const modular<T>& rhs) { return !(lhs == rhs); }

template <typename T> modular<T> operator+(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) += rhs; }
template <typename T, typename U> modular<T> operator+(const modular<T>& lhs, U rhs) { return modular<T>(lhs) += rhs; }
template <typename T, typename U> modular<T> operator+(U lhs, const modular<T>& rhs) { return modular<T>(lhs) += rhs; }

template <typename T> modular<T> operator-(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) -= rhs; }
template <typename T, typename U> modular<T> operator-(const modular<T>& lhs, U rhs) { return modular<T>(lhs) -= rhs; }
template <typename T, typename U> modular<T> operator-(U lhs, const modular<T>& rhs) { return modular<T>(lhs) -= rhs; }

template <typename T> modular<T> operator*(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) *= rhs; }
template <typename T, typename U> modular<T> operator*(const modular<T>& lhs, U rhs) { return modular<T>(lhs) *= rhs; }
template <typename T, typename U> modular<T> operator*(U lhs, const modular<T>& rhs) { return modular<T>(lhs) *= rhs; }

template <typename T> modular<T> operator/(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) /= rhs; }
template <typename T, typename U> modular<T> operator/(const modular<T>& lhs, U rhs) { return modular<T>(lhs) /= rhs; }
template <typename T, typename U> modular<T> operator/(U lhs, const modular<T>& rhs) { return modular<T>(lhs) /= rhs; }

template<typename T, typename U>
modular<T> pow (const modular<T>& a, const U& b) {
  assert(b >= 0);
  modular<T> x = a, res = 1;
  U p = b;
  for (; p > 0; p %= 2) {
    if (p & 1) res *= x;
    x *= x;
  }
  return res;
}

template <typename T>
std::string to_string(const modular<T>& a) {
  return std::to_string(a());
}
template <typename T>
std::ostream& operator<<(std::ostream& stream, const modular<T>& a) {
  return stream << a();
}
template <typename T>
std::istream& operator>>(std::istream& stream, modular<T>& a) {
  int x; stream >> x;
  a.value = modular<T>::normalize(x);
  return stream;
}
constexpr int md = 1'000'000'007;
using mint = modular<std::integral_constant<std::decay_t<decltype(md)>, md>>;

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int n, k; std::cin >> n >> k;
  std::vector<int> a;
  for (int i = 1; i * i <= n; i++) {
    a.push_back(i);
    if (i != n / i) a.push_back(n / i);
  }
  std::sort(a.begin(), a.end());
  int N = a.size();
  std::vector<mint> b, w;
  std::transform(a.begin(), a.end(), std::back_inserter(b), [](int x){return mint(x);});
  std::adjacent_difference(b.begin(), b.end(), std::back_inserter(w));
  std::vector<mint> dp(N, 1);
  auto renew = [&] {
    std::vector<mint> new_dp(N, 0);
    for (int i = N - 1; i >= 0; i--) {
      if (i < N - 1) new_dp.at(i) += new_dp.at(i + 1);
      new_dp.at(i) += dp.at(N - 1 - i) * w.at(N - 1 - i);
    }
    dp = new_dp;
  };
  for (int i = 0; i < k - 1; i++) renew();
  auto ret = std::inner_product(dp.begin(), dp.end(), w.begin(), mint(0));
  std::cout << ret << std::endl;
  return 0;
}

Measured memory_bytes: 1660