#include <bits/stdc++.h>
#define ll long long
#define BUF 1e5
#define INF 1 << 30
constexpr ll mod = 1e9 + 7;
using namespace std;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
//ll ans = 0;

template <ll mod>
class Fp {
public:
    ll val;

private:
    inline void calc_mod(ll &v) {
        if (v >= mod)
            v -= mod;
    }

public:
    Fp() {}
    Fp(ll v) : val(v % mod) {
        if (val < 0)
            val += mod;
    }
    Fp operator+=(const Fp &in) {
        val += in.val;
        calc_mod(val);
        return *this;
    }
    Fp operator+(const Fp &in) const {
        return Fp(*this) += in;
    }
    Fp &operator-=(const Fp &in) {
        val -= in.val;
        calc_mod(val);
        if (val < 0)
            val += mod;
        return *this;
    }
    Fp operator-(const Fp &in) const {
        return Fp(*this) -= in;
    }
    Fp &operator*=(const Fp &in) {
        val = val * in.val % mod;
        return *this;
    }
    Fp operator*(const Fp &in) const {
        return Fp(*this) *= in;
    }
    Fp &operator/=(const Fp &in) {
        *this *= modpow(in, mod - 2);
        return *this;
    }
    Fp operator/(const Fp &in) const {
        return Fp(*this) /= in;
    }
    bool operator==(const Fp &in) const {
        return val == in.val;
    }
    bool operator!=(const Fp &in) const {
        return val != in.val;
    }
    friend Fp modpow(const Fp &in, ll n) {
        if (n == 0)
            return 1;
        if (n & 1) {
            return in * modpow(in * in, n / 2);
        } else {
            return modpow(in * in, n / 2);
        }
    }
};
using modll = Fp<mod>;
class Factorial {
public:
    vector<modll> fact, finv;
    Factorial(ll n) : fact(n + 1, modll(1)), finv(n + 1, modll(1)) {
        for (int i = 2; i <= n; i++) {
            modll tmp(i);
            fact[i] = fact[i - 1] * tmp;
            finv[i] = finv[i - 1] / tmp;
        }
    }
    modll com(const ll &n, const ll &k) {
        if (n < k || n < 0 || k < 0)
            return modll(0);
        return fact[n] * finv[k] * finv[n - k];
    }
};

int main() {
    cin >> N >> K;
    int sqn = sqrt(N);
    int upper = N / sqn;
    vector<modll> v;
    for (int i = 1; i < upper; i++) {
        v.push_back(N / i - N / (i + 1));
    }
    vector<vector<modll>> dpover(K + 2, vector<modll>(v.size())), dpunder(K + 2, vector<modll>(sqn + 1, 0));
    for (int i = 0; i < v.size(); i++) {
        dpover[1][i] = v[i];
    }
    for (int i = 1; i <= sqn; i++)
        dpunder[1][i] = 1;

    for (int k = 1; k < K; k++) {
        modll tmp = 0;
        for (int i = v.size() - 1; i >= 0; i--) {
            tmp += dpover[k][i];
            dpunder[k + 1][i + 1] += tmp;
        }
        vector<modll> csum(sqn + 1);
        csum[1] = dpunder[k][1];
        for (int i = 2; i <= sqn; i++) {
            csum[i] = csum[i - 1] + dpunder[k][i];
        }
        for (int i = 0; i < v.size(); i++) {
            dpover[k + 1][i] = v[i] * csum[i + 1];
        }
        for (int i = 1; i <= sqn; i++) {
            dpunder[k + 1][i] += csum[sqn];
        }
    }
    modll ans = 0;
    for (int i = 1; i <= sqn; i++)
        ans += dpunder[K][i];
    for (int i = 0; i < v.size(); i++) {
        ans += dpover[K][i];
    }
    cout << ans.val << endl;
}

Measured memory_bytes: 51192