#include <stdio.h>
#include <math.h>
#include <algorithm>
#define N 66666
#define M 1000000007
using namespace std;
typedef long long LL;

LL a[N];
int c = 0, b[N];

int main()
{		
	int n, k, t, i, j, jj;
	
	scanf("%d%d", &n, &k);
	t = sqrt(n);
	for(i = 1; i < t; i++){
		b[c++] = 1;
	}
	for(; i <= n; i = j){
		j = n / (n / i) + 1;
		b[c++] = j - i;
	}
	for(i = 0; i < c; i++) a[i] = 1;
	for(i = 1; i <= k; i++){
		for(j = 1, jj = 0; j < c; jj = j++){
			a[j] = (a[jj] + a[j] * (LL)b[j]) % M;
		}
		reverse(a, a + c);
	}
	printf("%lld\n", a[0]);
			
	return 0;
}
### Prompt

Construct a cpp code solution to the problem outlined:

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 <stdio.h>
#include <math.h>
#include <algorithm>
#define N 66666
#define M 1000000007
using namespace std;
typedef long long LL;

LL a[N];
int c = 0, b[N];

int main()
{		
	int n, k, t, i, j, jj;
	
	scanf("%d%d", &n, &k);
	t = sqrt(n);
	for(i = 1; i < t; i++){
		b[c++] = 1;
	}
	for(; i <= n; i = j){
		j = n / (n / i) + 1;
		b[c++] = j - i;
	}
	for(i = 0; i < c; i++) a[i] = 1;
	for(i = 1; i <= k; i++){
		for(j = 1, jj = 0; j < c; jj = j++){
			a[j] = (a[jj] + a[j] * (LL)b[j]) % M;
		}
		reverse(a, a + c);
	}
	printf("%lld\n", a[0]);
			
	return 0;
}
```