#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const long long MOD_CONST = 1000000007;
long long mul_mod(long long a, long long b, const long long MOD) {
  return b ? (mul_mod(a * 2, b / 2, MOD) + (b & 1 ? a : 0)) % MOD : 0;
}

long long bpow_mod(long long a, long long b, const long long MOD) {
  return (b ? bpow_mod(a * a % MOD, b / 2, MOD) * (b & 1 ? a : 1) : 1) % MOD;
}

long long inv_mod(long long a, const long long MOD) {
  return bpow_mod(a, MOD - 2, MOD);
}
template <long long param = MOD_CONST, bool fast = false>
class mint {
 private:
  using Z = int;
  using N = unsigned int;
  using ZZ = long long;
  using NN = unsigned long long;
  struct {
  } constexpr static exact{};
  // Using Z deliberately to avoid Z -> N promotion.
  template <class Ret = ZZ&>
  static auto modulo() -> std::enable_if_t<(param <= 0), Ret> {
    static ZZ mod = 0;
    return mod;
  }
  template <class Ret = const ZZ>
  static auto mod() -> std::enable_if_t<(param <= 0), Ret> {
    return modulo();
  }
  template <class Ret = const ZZ>
  static constexpr auto mod() -> std::enable_if_t<(param > 0), Ret> {
    return param;
  }

 public:
  template <class Arg = ZZ>
  static void set_modulo(const std::enable_if_t<(param <= 0), Arg> mod) {
    modulo() = mod;
  }
  long long v;

  constexpr mint() : v(0) {}

  constexpr mint(long long v)
      : v(fast ? (v)
               : (v < 0 ? (v % mod() + mod()) % mod()
                        : (v >= mod() ? v % mod() : v))) {}
  constexpr long long get_mod() { return mod(); }
  long long get_val() { return v; }
  void take_mod() { v %= mod(); }
};
template <long long param, bool fast>
ostream& operator<<(ostream& os, mint<param, fast>& x) {
  return os << (x.v % x.get_mod() + x.get_mod()) % x.get_mod();
}

template <long long param, bool fast, bool fast2>
bool operator==(mint<param, fast>& a, mint<param, fast2> b) {
  return a.v == b.v;
}
template <long long param, bool fast, bool fast2>
mint<param, fast>& operator+=(mint<param, fast>& a, mint<param, fast2> b) {
  return a = a.v + b.v;
}
template <long long param>
mint<param>& operator-=(mint<param>& a, mint<param> b) {
  return a = a.v - b.v;
}
template <long long param>
mint<param>& operator*=(mint<param>& a, mint<param> b) {
  return a = a.v * b.v;
}
template <long long param>
mint<param>& operator/=(mint<param>& a, mint<param> b) {
  return a = a.v * inv_mod(b.v, a.get_mod());
}
template <long long param, bool fast, bool fast2>
mint<param, fast> operator+(mint<param, fast> a, mint<param, fast2> b) {
  return a += b;
}
template <long long param>
mint<param> operator-(mint<param> a, mint<param> b) {
  return a -= b;
}
template <long long param>
mint<param> operator*(mint<param> a, mint<param> b) {
  return a *= b;
}
template <long long param>
mint<param> operator/(mint<param> a, mint<param> b) {
  return a /= b;
}
template <long long param, bool fast>
mint<param, fast>& operator+=(mint<param, fast>& a, long long b) {
  return a = a.v + b;
}
template <long long param>
mint<param>& operator-=(mint<param>& a, long long b) {
  return a = a.v - b;
}
template <long long param>
mint<param>& operator*=(mint<param>& a, long long b) {
  return a = a.v * b;
}
template <long long param>
mint<param>& operator/=(mint<param>& a, long long b) {
  return a = a.v * inv_mod(b, a.get_mod());
}
template <long long param, bool fast>
mint<param, fast> operator+(mint<param> a, long long b) {
  return a += b;
}
template <long long param>
mint<param> operator-(mint<param> a, long long b) {
  return a -= b;
}
template <long long param>
mint<param> operator*(mint<param> a, long long b) {
  return a *= b;
}
template <long long param>
mint<param> operator/(mint<param> a, long long b) {
  return a /= b;
}
/*
typedef vector<mint<>> VI;
typedef vector<VI> VVI;

VVI mult(VVI a, VVI b) {
  int n = a.size();
  VVI ret(n, VI(n, mint<>(0)));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++) ret[i][k] += a[i][j] * b[j][k];
  return ret;
}

VVI mat_pow(VVI a, int k) {
  if (k == 1) return a;
  VVI ret = mat_pow(a, k / 2);
  ret = mult(ret, ret);
  if (k % 2 == 1) {
    ret = mult(ret, a);
  }
  return ret;
}
*/
typedef pair<int, int> PII;

int main() {
  int N, K;
  cin >> N >> K;

  vector<int> nums;
  int cnt = 0;
  int low = 0;
  for (int i = 1;; i++) {
    nums.push_back(N / i - N / (i + 1));
    int lower = N / (i + 1);
    if (lower == i) {
      nums.push_back(1);
      break;
    }
    if (lower < i) {
      // nums.push_back(1);
      break;
    }
    cnt++;
  }
  for (int i = 0; i < cnt; i++) nums.push_back(1);
  reverse(nums.begin(), nums.end());

  vector<mint<>> dp(nums.size());
  for (int i = 0; i < nums.size(); i++) dp[i] = nums[i];

  for (int k = 0; k < K - 1; k++) {
    vector<mint<>> ruiseki(nums.size()), tmp(nums.size());
    ruiseki[0] = dp[0];
    for (int i = 1; i < nums.size(); i++) ruiseki[i] = ruiseki[i - 1] + dp[i];
    for (int i = 0; i < nums.size(); i++)
      tmp[i] = ruiseki[nums.size() - 1 - i] * nums[i];
    dp = tmp;
  }
  mint<> ans;
  for (auto val : dp) ans += val;
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 2044