#include<bits/stdc++.h>
using namespace std;
#define rep1(i,n) for(int i = 1; i < n; i++)
const int md = 1e9+7;
const int mx = 100005;
int n, k, comp[mx], r = 1;
long long dp[mx];
int main(){
	scanf("%d%d", &n, &k);
	for(; r*r <= n; r++) comp[r] = n/r - n/(r+1);
	fill(comp+r,comp+r+n/r, 1);
	r += n/r;
	reverse(comp+1, comp+r);
	for(int i = 0; i < k; i++){
		int temp[mx] = {};
		rep1(j,r) temp[j] = ((i ? dp[r-j] : 1) * comp[j]) % md;
		rep1(j,r) dp[j] = (dp[j-1] + temp[j]) % md;
	}
	printf("%lld\n", dp[r-1]);
}
### 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;
#define rep1(i,n) for(int i = 1; i < n; i++)
const int md = 1e9+7;
const int mx = 100005;
int n, k, comp[mx], r = 1;
long long dp[mx];
int main(){
	scanf("%d%d", &n, &k);
	for(; r*r <= n; r++) comp[r] = n/r - n/(r+1);
	fill(comp+r,comp+r+n/r, 1);
	r += n/r;
	reverse(comp+1, comp+r);
	for(int i = 0; i < k; i++){
		int temp[mx] = {};
		rep1(j,r) temp[j] = ((i ? dp[r-j] : 1) * comp[j]) % md;
		rep1(j,r) dp[j] = (dp[j-1] + temp[j]) % md;
	}
	printf("%lld\n", dp[r-1]);
}
```