#include<bits/stdc++.h>
using namespace std;
const int maxn=653000+10;
const int mod=1e9+7;
int c[maxn];
int dp[105][maxn];
int main(){
    int n,k; cin>>n>>k;
    int d=0;
    for(int l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        c[++d]=(r-l+1);
    }
    for(int i=1;i<=d;i++){
        (dp[1][i]+=dp[1][i-1]+c[i])%=mod;
    }
    for(int i=2;i<=k;i++){
        for(int j=1;j<=d;j++){
            dp[i][j]=(1ll*c[j]*dp[i-1][d-j+1]%mod)+dp[i][j-1];
            dp[i][j]%=mod;
        }
    }
    cout<<dp[k][d]<<endl;
}

### Prompt

Your task is to create 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>
using namespace std;
const int maxn=653000+10;
const int mod=1e9+7;
int c[maxn];
int dp[105][maxn];
int main(){
    int n,k; cin>>n>>k;
    int d=0;
    for(int l=1,r;l<=n;l=r+1){
        r=n/(n/l);
        c[++d]=(r-l+1);
    }
    for(int i=1;i<=d;i++){
        (dp[1][i]+=dp[1][i-1]+c[i])%=mod;
    }
    for(int i=2;i<=k;i++){
        for(int j=1;j<=d;j++){
            dp[i][j]=(1ll*c[j]*dp[i-1][d-j+1]%mod)+dp[i][j-1];
            dp[i][j]%=mod;
        }
    }
    cout<<dp[k][d]<<endl;
}

```