#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>

using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> void printvec(const vector<T>& v) {
  for (auto x : v) { cout << x << " "; }
  cout << endl;
}
template<class T> void printtree(const vector< vector<T> >& tree) {
  for (long long i = 0; i < tree.size(); ++i) {
    cout << i + 1 << ": "; printvec(tree[i]);
  }
}
template<class T, class U> void printmap(const map<T, U>& mp) {
  for (auto x : mp) { cout << x.first << "=>" << x.second << endl; }
}

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; }

#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;

const ll INF = 1e9;
const ll MOD = 1000000007;  // 1e9 + 7

// Mod int
// cf. https://www.youtube.com/watch?v=1Z6ofKN03_Y
struct mint {
  ll x;
  mint(ll x = 0) : x((x + MOD) % MOD) {}
  mint& operator+= (const mint a) {
    if ((x += a.x) >= MOD) x %= MOD;
    return *this;
  }
  mint operator+ (const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint& operator-= (const mint a) {
    if ((x += MOD - a.x) >= MOD) x %= MOD;
    return *this;
  }
  mint operator- (const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint& operator*= (const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator* (const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t) { return 1; }
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const {
    return pow(MOD-2);
  }
  mint& operator/= (const mint a) {
    return (*this) *= a.inv();
  }
  mint operator/ (const mint a) const {
    mint res(*this);
    return res /= a;
  }
};

int main(int argc, char** argv) {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  //cout << setprecision(10) << fixed;

  ll n, k;
  cin >> n >> k;
  vector<pair<ll, ll>> s; // s[i] .. pair of <n/number, count>
  for (int i = 1; i * i <= n; ++i) {
    s.push_back(P(i,0));
    s.push_back(P(n/i,0));
  }
  sort(all(s));
  s.erase(unique(all(s)), s.end());
  rep(i, s.size()-1) {
    ll l = n/s[i+1].first;
    ll r = n/s[i].first;
    s[i].second = r-l;
  }
  s.back().second = 1;

  ll m = s.size();
  map<ll, ll> mp; // map real number to index in s.
  rep(i, m) {
    mp[s[i].first] = i;
  }

  // dp[i][j] .. use [0, i), number is n/j at i-1.
  vector<vector<mint>> dp(k+1, vector<mint>(m));
  dp[0][mp[n]] = 1;
  rep(i, k) {
    // calculate cummulated sum. j is large <=> n/j is small.
    for (int j = m-2; j >= 0; --j) {
      dp[i][j] += dp[i][j+1];
    }
    for (int j = m-1; j >= 0; --j) {
      // Add the contribution where j*j' <= n
      int nj = mp[n/s[j].first];
      dp[i+1][j] = dp[i][nj]; // cummulative sum of [nj..m).
      dp[i+1][j] *= s[j].second; // j is duplicated
    }
  }
  mint ans(0);
  rep(j, m) {
    ans += dp[k][j];
  }
  cout << ans.x << endl;
}


Measured memory_bytes: 55668