#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'


pll merge(pll a, pll b) {
  if (a == pll(0, 0)) return b;
  return pii(min(a.first, b.first), max(a.second, b.second));
}

int main() {
  ll n, k;
  cin >> n >> k;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  
  ll a;
  map<ll, pll, greater<ll>> mp;
  for (a = 1; a * a <= n; a++) {
    mp[n / a] = merge(mp[n / a], pll(a, a));
  }

  for (a = 1; a * a <= n; a++) {
    ll mi, ma;
    mi = n / (a + 1) + 1;
    ma = n / a;
    ma = min(ma, n);
    mp[a] = merge(mp[a], pll(mi, ma));
  }
  
  // for (auto itr = mp.begin(); itr != mp.end(); itr++) {
  //   cout << itr->first << " " << itr->second << endl;
  // }
  
  int cnt = mp.size();
  vll dp(k + 1, vl(cnt));
  vl num(cnt);
  int i = 0;
  for (auto itr = mp.begin(); itr != mp.end(); itr++) {
    pll temp = itr->second;
    num[i] = temp.second - temp.first + 1;
    i++;
  }

  dp[0][0] = 1;
  rep (i, k) {
    int j = 0;
    for (auto itr1 = mp.begin(); itr1 != mp.end(); itr1++) {
      // int k = 0;
      (dp[i + 1][0] += dp[i][j]) %= MOD;
      if (mp.size() - j < cnt) {
        (dp[i + 1][mp.size() - j] -= dp[i][j]) %= MOD;
      }
      // for (auto itr = mp.begin(); itr != mp.end(); itr++) {
      //   ll zibun = itr1->second.first;
      //   ll aite = itr->second.first;
      //   if (zibun * aite > n) break;
      //   (dp[i + 1][k] += dp[i][j]) %= MOD;
      //   k++;
      // }
      j++;
    }
    rep (j, cnt - 1) {
      (dp[i + 1][j + 1] += dp[i + 1][j]) %= MOD;
    }
    rep (j, cnt) {
      (dp[i + 1][j] *= num[j]) %= MOD;
    }
  }
  //DEBUG_MAT(dp);

  ll ans = 0;
  rep (i, cnt) {
    (ans += dp[k][i]) %= MOD;
  }
  ans = (ans + MOD) % MOD;
  cout << ans << endl;
  
}


Measured memory_bytes: 54800