#include<bits/stdc++.h>
#define int long long
#define N 105
#define K 73140
#define P 1000000007
using namespace std;
int n,m,f[N][K],X[K],Y[K];
signed main(){
	scanf("%lld%lld",&m,&n);
	int x=1,y,res,tot=0;
	while(x<=m){
		res=m/x;
		y=m/res;
		X[++tot]=x,Y[tot]=y;
		x=y+1;
	}
	for(int i=1;i<=tot;i++)f[0][i]=1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=tot;j++)
			f[i][j]=(f[i-1][tot-j+1]*(Y[j]-X[j]+1)%P+f[i][j-1])%P;
	printf("%lld\n",f[n][tot]);
	return 0;
}
### Prompt

Generate 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 int long long
#define N 105
#define K 73140
#define P 1000000007
using namespace std;
int n,m,f[N][K],X[K],Y[K];
signed main(){
	scanf("%lld%lld",&m,&n);
	int x=1,y,res,tot=0;
	while(x<=m){
		res=m/x;
		y=m/res;
		X[++tot]=x,Y[tot]=y;
		x=y+1;
	}
	for(int i=1;i<=tot;i++)f[0][i]=1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=tot;j++)
			f[i][j]=(f[i-1][tot-j+1]*(Y[j]-X[j]+1)%P+f[i][j-1])%P;
	printf("%lld\n",f[n][tot]);
	return 0;
}
```