#include<bits/stdc++.h>
using namespace std;
int n,k,S[70004],E[70004],a,mo=1e9+7;
long long AN[102][70004];
int main() {
	scanf("%d %d",&n,&k);
	int s=1,e,fo;
	while(s<=n) {
		fo=n/s,e=n/fo;
		S[++a]=s,E[a]=e;
		s=e+1;
	}
	for(int i=1; i<=a; i++) AN[1][i]=E[i];
	for(int i=2; i<=k; i++) {
		for(int j=1; j<=a; j++)AN[i][j]=AN[i-1][a-j+1]*(E[j]-S[j]+1)%mo;
		for(int j=1; j<=a; j++) (AN[i][j]+=AN[i][j-1])%=mo;
	}
	printf("%lld",AN[k][a]);
	return 0;
}
### Prompt

Develop a solution in Cpp 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,S[70004],E[70004],a,mo=1e9+7;
long long AN[102][70004];
int main() {
	scanf("%d %d",&n,&k);
	int s=1,e,fo;
	while(s<=n) {
		fo=n/s,e=n/fo;
		S[++a]=s,E[a]=e;
		s=e+1;
	}
	for(int i=1; i<=a; i++) AN[1][i]=E[i];
	for(int i=2; i<=k; i++) {
		for(int j=1; j<=a; j++)AN[i][j]=AN[i-1][a-j+1]*(E[j]-S[j]+1)%mo;
		for(int j=1; j<=a; j++) (AN[i][j]+=AN[i][j-1])%=mo;
	}
	printf("%lld",AN[k][a]);
	return 0;
}
```