#include<bits/stdc++.h>
#define LL long long
using namespace std;

const LL mod=1e9+7;
LL f[105][64004],ans;

int main()
{
	LL n,N,k;
	scanf("%lld%lld",&N,&k);
	n=sqrt(N);
	for(int i=1;i<=n;++i) f[1][i]=1;
	f[1][n+1]=N/n-n;
	for(int i=n+2;i<=2*n;++i) f[1][i]=N/(2*n+1-i)-N/(2*n+2-i);
	for(int i=2;i<=k;++i) {
		LL sum=0;
		for(int j=2*n;j>=1;--j) {
			(sum+=f[i-1][2*n+1-j])%=mod;
			f[i][j]=sum*f[1][j]%mod;
		}
	}
	for(int i=1;i<=2*n;++i) (ans+=f[k][i])%=mod;
	cout<<ans%mod;
}
### 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 LL long long
using namespace std;

const LL mod=1e9+7;
LL f[105][64004],ans;

int main()
{
	LL n,N,k;
	scanf("%lld%lld",&N,&k);
	n=sqrt(N);
	for(int i=1;i<=n;++i) f[1][i]=1;
	f[1][n+1]=N/n-n;
	for(int i=n+2;i<=2*n;++i) f[1][i]=N/(2*n+1-i)-N/(2*n+2-i);
	for(int i=2;i<=k;++i) {
		LL sum=0;
		for(int j=2*n;j>=1;--j) {
			(sum+=f[i-1][2*n+1-j])%=mod;
			f[i][j]=sum*f[1][j]%mod;
		}
	}
	for(int i=1;i<=2*n;++i) (ans+=f[k][i])%=mod;
	cout<<ans%mod;
}
```