#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+10;
const int P=1e9+7;
int n,m,k,a[N],l[N],dp[110][N];
map<int,int> b; 

int main()
{
	cin>>n>>k;
	for (int x=1,gx;x<=n;x=gx+1) {
		gx=n/x ? min(n/(n/x),n) : n;
		a[++m]=gx; l[m]=gx-x+1;
		b[gx]=m;
	}
	for (int j=0;j<=m;j++) dp[0][j]=1;
	for (int i=1;i<=k;i++) {
		for (int j=1;j<=m;j++) {
			dp[i][j]=(dp[i][j-1]+(LL)l[j]*dp[i-1][b[n/a[j]]]%P)%P;
		}
	}
	cout<<dp[k][m]<<endl;
	return 0;
}
### Prompt

Construct a CPP code solution to the problem outlined:

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;
typedef long long LL;
const int N=1e5+10;
const int P=1e9+7;
int n,m,k,a[N],l[N],dp[110][N];
map<int,int> b; 

int main()
{
	cin>>n>>k;
	for (int x=1,gx;x<=n;x=gx+1) {
		gx=n/x ? min(n/(n/x),n) : n;
		a[++m]=gx; l[m]=gx-x+1;
		b[gx]=m;
	}
	for (int j=0;j<=m;j++) dp[0][j]=1;
	for (int i=1;i<=k;i++) {
		for (int j=1;j<=m;j++) {
			dp[i][j]=(dp[i][j-1]+(LL)l[j]*dp[i-1][b[n/a[j]]]%P)%P;
		}
	}
	cout<<dp[k][m]<<endl;
	return 0;
}
```