#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}

template<typename T,T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  // find x s.t. a^x = b
  static T log(T a,T b){
    const T sq=40000;
    unordered_map<T, T> dp;
    dp.reserve(sq);
    Mint res(1);
    for(int r=0;r<sq;r++){
      if(!dp.count(res.v)) dp[res.v]=r;
      res*=a;
    }
    Mint p=Mint(a).inv().pow(sq);
    res=b;
    for(int q=0;q<=MOD/sq+1;q++){
      if(dp.count(res.v)){
        T idx=q*sq+dp[res.v];
        if(idx>0) return idx;
      }
      res*=p;
    }
    assert(0);
    return T(-1);
  }

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T,T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

//INSERT ABOVE HERE
template<typename D = long long, int useAssert = 1>
class BIT{
public:
  int n;
  vector<D> bit0, bit1;
  BIT(){n = -1;}
  BIT(int n_){
    n = 1;
    while(n < n_) n *= 2;
    bit0.resize(n+1, 0);
    bit1.resize(n+1, 0);
  }

  D sum(vector<D> &b, int i){
    D s = 0;
    while(i > 0){
      s = (s + b[i]);// % mod;
      i -= i & -i;
    }
    return s;
  }

  void add(vector<D> &b, int i, D v){
    // v = (mod + v % mod) % mod;
    while(i <= n){
      b[i] = (b[i] + v);//% mod;
      i += i & -i;
    }
  }

  //[a,b)にxを加算 0オリジン
  void add (int a, int b, D x){
    // x = (mod + x % mod) % mod;
    if(a == b) return;
    a++;
    if(useAssert) assert(a <= b && 1 <= a && b <= n);
    add(bit0, a, -x*(a-1));
    add(bit1, a, x);
    add(bit0, b+1, x*b);
    add(bit1, b+1, -x);
  }

  //[a,b)のsumを得る 0オリジン
  D sum(int a, int b){
    if(a == b) return 0;
    a++;
    if(useAssert) assert(a <= b && 1 <= a && b <= n);
    D s = sum(bit0, b);
    D t = sum(bit1, b) * b;
    D u = sum(bit0, a-1);
    D v = sum(bit1, a-1) * (a-1);
    return s + t - u - v;
    //return ((s + t) + (mod - u%mod) + (mod - v%mod)) % mod;
  }
};


using mint = Mint<Int, mod>;

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  int N, K;
  cin>>N>>K;

  auto getR=[&](int x){
    int L = 0, R = N;
    while(L + 1 < R){
      int M = (L + R) / 2;
      N / (x + M) == N / x? (L = M):(R = M);
    }
    return x + L;
  };

  vector<P> LR;
  vector<int> tidx;
  {
    int l = 1;
    while(l <= N){
      int r = getR(l);
      LR.emplace_back(l, r);
      l = r + 1;
    }
  }

  auto getT=[&](int t){
    int L = 0, R = (int)LR.size();
    while(L + 1 < R){
      int M = (L + R) / 2;
      int l, r; tie(l, r) = LR[M];
      t >= l? (L = M): (R = M);
    }
    return L;
  };

  vector<int> T;
  {
    for(int i=0;i<(int)LR.size();i++){
      int l, r; tie(l, r) = LR[i];
      T.push_back(getT(N/l));
    }
  }

  BIT<mint, 0> dp(LR.size() + 10);
  for(int i=0;i<(int)LR.size();i++){
    int l, r; tie(l, r) = LR[i];
    dp.add(i, i+1, r - l + 1);
  }


  for(int k=0;k<K-1;k++){
    BIT<mint, 0> ndp(LR.size() + 10);
    for(int i=0;i<(int)LR.size();i++){
      int l, r; tie(l, r) = LR[i];
      int t = N/l;
      //int tidx = getT(t);
      int tidx = T[i];
      //assert(N/l == N/r);
      //assert(LR[tidx].second * r <= N);
      mint val = dp.sum(0, tidx + 1);
      //pr(l, r, t, LR[tidx], val);
      ndp.add(i, i+1, val * (r - l + 1));
    }
    dp = ndp;
  }

  mint ans = dp.sum(0, LR.size() + 10);
  cout<<ans<<endl;

  return 0;
}


Measured memory_bytes: 3828