#include<bits/stdc++.h>
using namespace std;


#define uli         unsigned long long int
#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n, k;

li dp[111][100100];

li nums[100100];

int main() {
    cin >> n >> k;
    li nn = sqrt(n);
    if (nn * (nn + 1) <= n) {
        rep(i, nn) {
            nums[i] = 1;
        }
        li cur = nn + 1;
        li opp = nn;
        for (li i = nn; i < 2 * nn; i++) {
            li next = n / opp;
            nums[i] = next - cur + 1;
            cur = next + 1;
            opp--;
        }
        dp[0][0] = nums[0];
        repp(i, 1, nn * 2) {
            dp[0][i] = nums[i] + dp[0][i - 1];
        }
        repp(i, 1, k) {
            dp[i][0] = dp[i - 1][nn * 2 - 1] * nums[0] % MOD;
            repp(j, 1, nn * 2) {
                dp[i][j] = (dp[i - 1][nn * 2 - 1 - j] * nums[j] % MOD + dp[i][j - 1]) % MOD;
            }
        }
        //dump(nums, nn * 2);
        //rep(i, k) {
        //    rep(j, nn * 2)cout << dp[i][j] << " "; cout << endl;
        //}
        cout << dp[k - 1][nn * 2 - 1] << endl;
    } else {
        rep(i, nn) {
            nums[i] = 1;
        }
        li cur = nn + 1;
        li opp = nn - 1;
        for (li i = nn; i < 2 * nn - 1; i++) {
            li next = n / opp;
            nums[i] = next - cur + 1;
            cur = next + 1;
            opp--;
        }
        dp[0][0] = nums[0];
        repp(i, 1, nn * 2 - 1) {
            dp[0][i] = nums[i] + dp[0][i - 1];
        }
        repp(i, 1, k) {
            dp[i][0] = dp[i - 1][nn * 2 - 2] * nums[0] % MOD;
            repp(j, 1, nn * 2 - 1) {
                dp[i][j] = (dp[i - 1][nn * 2 - 2 - j] * nums[j] % MOD + dp[i][j - 1]) % MOD;
            }
        }
        //dump2d(dp, nn * 2 - 1, k);
        cout << dp[k - 1][nn * 2 - 2] << endl;
    }

    return 0;
}

Measured memory_bytes: 79488