#include<bits/stdc++.h>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define ll long long
using namespace std;

const ll mod = 1e9+7;

ll n;int k;
ll S[110][202000],B[110][202000];

int main(){
    cin>>n>>k;
    ll d=sqrt(n);
    ll ans=0;
    S[0][1]=1;
    FOR(i,1,k){
        FOR(j,1,d)S[i-1][j]=(S[i-1][j]+S[i-1][j-1])%mod;
        FOR(j,1,d)B[i-1][j]=(B[i-1][j]+B[i-1][j-1])%mod;
        FOR(j,1,d){
            S[i][j]=(S[i-1][d]+B[i-1][d]-B[i-1][j-1]+mod)%mod;
            B[i][j]=(n/j-n/(j+1))*S[i-1][j]%mod;
            if(j==n/j)B[i][j]=0;//SжагаСЫ
        }
    }
    FOR(i,1,d)ans=(ans+S[k][i]+B[k][i])%mod;
    cout<<ans<<endl;
}

### Prompt

Your challenge is to write a CPP solution to the following problem:

Find the number of sequences of length K consisting of positive integers such that the product of any two adjacent elements is at most N, modulo 10^9+7.

Constraints

* 1\leq N\leq 10^9
* ~~1~~ 2\leq K\leq 100 (fixed at 21:33 JST)
* N and K are integers.

Input

Input is given from Standard Input in the following format:


N K


Output

Print the number of sequences, modulo 10^9+7.

Examples

Input

3 2


Output

5


Input

10 3


Output

147


Input

314159265 35


Output

457397712

### Response

```cpp
#include<bits/stdc++.h>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define ll long long
using namespace std;

const ll mod = 1e9+7;

ll n;int k;
ll S[110][202000],B[110][202000];

int main(){
    cin>>n>>k;
    ll d=sqrt(n);
    ll ans=0;
    S[0][1]=1;
    FOR(i,1,k){
        FOR(j,1,d)S[i-1][j]=(S[i-1][j]+S[i-1][j-1])%mod;
        FOR(j,1,d)B[i-1][j]=(B[i-1][j]+B[i-1][j-1])%mod;
        FOR(j,1,d){
            S[i][j]=(S[i-1][d]+B[i-1][d]-B[i-1][j-1]+mod)%mod;
            B[i][j]=(n/j-n/(j+1))*S[i-1][j]%mod;
            if(j==n/j)B[i][j]=0;//SжагаСЫ
        }
    }
    FOR(i,1,d)ans=(ans+S[k][i]+B[k][i])%mod;
    cout<<ans<<endl;
}

```