10209: ABC132 - F - Small Products
[Creator : ]
Description
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$.
Input
Input is given from Standard Input in the following format:
```
$N$ $K$
```
```
$N$ $K$
```
Output
Print the number of sequences, modulo $10^9+7$.
Constraints
- $1\leq N\leq 10^9$
- 1 $2\leq K\leq 100$
- $N$ and $K$ are integers.
- 1 $2\leq K\leq 100$
- $N$ and $K$ are integers.
Sample 1 Input
3 2
Sample 1 Output
5
(1,3), (2,1)(2,1), and (3,1) satisfy the condition.
Sample 2 Input
10 3
Sample 2 Output
147
Sample 3 Input
314159265 35
Sample 3 Output
457397712