#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n, k;
    cin >> n >> k;
    k += 3;
    ll d = sqrt(n) + 0.00000000001;
    vector<vector<ll>> z(k, vector<ll>(d));
    vector<vector<ll>> gyakuz(k,vector<ll>(d));
    vector<ll> gyakuzseki(d);
    vector<ll> ans(k);
    for (ll i = 0; i < d; i++) {
        gyakuzseki[i] = (n / (i + 1)) - (n / (i + 2));
        if (i == d - 1)gyakuzseki[i] = (n / (i + 1)) - d;
    }
    z[1][0] = 1;
    ans[1] = 1;
    for (int i = 2; i < k; i++) {
        vector<ll> m(d);
        for (int j = 0; j < d; j++) {
            m[j] = z[i - 2][j];
            m[j] %= 1000000007;
        }

        for (int j = 1; j < d; j++) {
            m[j] += m[j - 1];
            m[j] %= 1000000007;
        }
        for (int j = 0; j < d; j++) {
            m[j] *= gyakuzseki[j];
            m[j] %= 1000000007;
        }
        for (int j = 2; j < d+1; j++) {
            m[d-j] += m[d-j + 1];
            m[d-j] %= 1000000007;
        }
        for (int j = 0; j < d; j++) {
            z[i][j] += ans[i-1];
            z[i][j] %= 1000000007;
        }
        for (int j = 0; j < d; j++) {
            z[i][j] += m[j];
            z[i][j] %= 1000000007;
        }
        for (int j = 0; j < d; j++) {
            ans[i] += z[i][j];
            ans[i] %= 1000000007;
        }
    }
    cout << z[k - 1][0] << endl;
}

Measured memory_bytes: 54716