#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

template<int Mod> class ModInt {
  int v;
public:
  constexpr ModInt(const long long x = 0) noexcept : v((x % Mod + Mod) % Mod) {};
  constexpr ModInt &operator+=(const ModInt rhs) noexcept {
    v += rhs.v;
    if (v >= Mod)
      v -= Mod;
    return *this;
  }
  constexpr ModInt &operator-=(const ModInt rhs) noexcept {
    if (v < rhs.v)
      v += Mod;
    v -= rhs.v;
    return *this;
  }
  constexpr ModInt &operator*=(const ModInt rhs) noexcept {
    v = int(1LL * v * rhs.v % Mod);
    return *this;
  }
  constexpr ModInt &operator/=(ModInt rhs) noexcept {
    long long exp = Mod - 2;
    while (exp) {
      if (exp & 1)
        *this *= rhs;
      rhs *= rhs;
      exp >>= 1;
    }
    return *this;
  }
  constexpr ModInt operator-() const noexcept { return ModInt(-v); }
  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 bool operator==(const ModInt rhs) const noexcept {
    return v == rhs.v;
  }
  constexpr bool operator!=(const ModInt rhs) const noexcept {
    return v != rhs.v;
  }
  constexpr ModInt pow(long long exp) const noexcept {
    ModInt res(1), mul(v);
    while (exp) {
      if (exp & 1)
        res *= mul;
      mul *= mul;
      exp >>= 1;
    }
    return res;
  }
  friend ostream &operator<<(ostream &os, const ModInt obj) noexcept {
    return os << obj.v;
  }
  friend istream &operator>>(istream &is, ModInt &obj) noexcept {
    long long tmp;
    is >> tmp;
    obj = ModInt<Mod>(tmp);
    return is;
  }
};
constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;

class BIT {
  vector<mint> dat;
public:
  BIT (int n) {
    dat.resize(n+1, 0);
  }
  void add(int i, mint n) {
    while (i < dat.size()) {
      dat[i] += n;
      i += i & -i;
    }
  }
  mint sum(int i) {
    mint res = 0;
    while (i > 0) {
      res += dat[i];
      i -= i & -i;
    }
    return res;
  }
  void clear() {
    for (int i = 1; i < dat.size(); i++)
      dat[i] = 0;
  }
};

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> num;
  for (int i = 1; i*i <= n; i++) {
    num.push_back(i);
    num.push_back(n/i);
  }
  sort(num.begin(), num.end());
  num.erase(unique(num.begin(), num.end()), num.end());
  vector<vector<mint>> dp(k, vector<mint>(num.size()));
  vector<BIT> bit(2, num.size());
  rep(i, num.size()) {
    if (num[i] <= sqrt(n))
      dp[0][i] = 1;
    else
      dp[0][i] = num[i]-num[i-1];
    bit[0].add(i+1, dp[0][i]);
  }
  for (int i = 1; i < k; i++) {
    int b = i%2^1;
    bit[b^1].clear();
    rep(j, num.size()) {
      int idx = lower_bound(num.begin(), num.end(), n/num[j])-num.begin()+1;
      if (num[j] <= sqrt(n))
        dp[i][j] = bit[b].sum(idx);
      else
        dp[i][j] = bit[b].sum(idx)*(num[j]-num[j-1]);
      bit[b^1].add(j+1, dp[i][j]);
    }
  }
  mint ans = 0;
  rep(i, num.size())
    ans += dp[k-1][i];
  cout << ans << endl;
  return 0;
}

Measured memory_bytes: 26116