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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

using namespace std;

const int mo = 1e9 + 7;
const int Maxn = 200001;

long long f[2][Maxn], m[Maxn];
vector<int> v;
int n, k, siz, nx;

int main() {
    cin >> n >> k;
    for(int i = 1; i * i <= n; ++i) 
        v.push_back(i), v.push_back(n / i);
    stable_sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    siz = v.size();
    m[0] = 1;
    f[0][0] = 1;
    for(int i = 1; i < siz; ++i)
        m[i] = v[i] - v[i - 1], f[0][i] = m[i];
    for(int i = 1; i < k; ++i) {
        nx = (i & 1);
        long long sum = 0;
        memset(f[nx], 0, sizeof(f[nx]));
        for(int j = 0; j < siz; ++j) {
            sum += f[nx ^ 1][j];
            sum %= mo;
            f[nx][siz - j - 1] += sum * m[siz - j - 1] % mo;
            f[nx][siz - j - 1] %= mo;
        }
    }
    long long ans = 0;
    for(int i = 0; i < siz; ++i)
        ans += f[nx][i];
    cout << ans % mo << endl;
    return 0;
}