#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
const int maxm=1e5+5;
const int mod=1e9+7;
int d[105][70005];
pair<int,int>p[maxm];
map<int,int>mark;
int n,k;
signed main(){
    cin>>n>>k;
    int m=0;
    for(int i=1,j;i<=n;i=j+1){
        j=n/(n/i);
        p[++m]={j,j-i+1};
        mark[j]=m;
    }
    for(int i=1;i<=m;i++){
        d[1][i]=(d[1][i-1]+p[i].second)%mod;
    }
    for(int i=2;i<=k;i++){
        for(int j=1;j<=m;j++){
            d[i][j]=(d[i][j-1]+p[j].second*d[i-1][mark[n/p[j].first]]%mod)%mod;
        }
    }
    cout<<d[k][m]<<endl;
    return 0;
}
/*

*/

### Prompt

In Cpp, your task is to solve 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;
#define int long long
#define PI pair<int,int>
const int maxm=1e5+5;
const int mod=1e9+7;
int d[105][70005];
pair<int,int>p[maxm];
map<int,int>mark;
int n,k;
signed main(){
    cin>>n>>k;
    int m=0;
    for(int i=1,j;i<=n;i=j+1){
        j=n/(n/i);
        p[++m]={j,j-i+1};
        mark[j]=m;
    }
    for(int i=1;i<=m;i++){
        d[1][i]=(d[1][i-1]+p[i].second)%mod;
    }
    for(int i=2;i<=k;i++){
        for(int j=1;j<=m;j++){
            d[i][j]=(d[i][j-1]+p[j].second*d[i-1][mark[n/p[j].first]]%mod)%mod;
        }
    }
    cout<<d[k][m]<<endl;
    return 0;
}
/*

*/

```