#include<bits/stdc++.h>
using namespace std;
int n,k,d[105][80000],l[80000],r[80000],cnt,M=1e9+7;
int main()
{
	cin>>n>>k;
	int x=1,y;
	while(x<=n)
	{
		y=n/(n/x);
		l[++cnt]=x;
		r[cnt]=y;
		x=y+1;
	}
	for(int i=1;i<=cnt;i++)d[1][i]=r[i];
	for(int i=2;i<=k;i++)
		for(int j=1;j<=cnt;j++)
			d[i][j]=(1ll*d[i-1][cnt-j+1]*(r[j]-l[j]+1)+d[i][j-1])%M;
	printf("%d",d[k][cnt]);
}
### Prompt

Please provide a CPP coded solution to the problem described below:

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;
int n,k,d[105][80000],l[80000],r[80000],cnt,M=1e9+7;
int main()
{
	cin>>n>>k;
	int x=1,y;
	while(x<=n)
	{
		y=n/(n/x);
		l[++cnt]=x;
		r[cnt]=y;
		x=y+1;
	}
	for(int i=1;i<=cnt;i++)d[1][i]=r[i];
	for(int i=2;i<=k;i++)
		for(int j=1;j<=cnt;j++)
			d[i][j]=(1ll*d[i-1][cnt-j+1]*(r[j]-l[j]+1)+d[i][j-1])%M;
	printf("%d",d[k][cnt]);
}
```