#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

template<typename T>
struct Compress {
private:
    vector<T> value;
    
public:
    Compress(const vector<T> &v, bool distinct = false) {
        int n = v.size();
        value.resize(n);
        value = v;
        sort(value.begin(), value.end());
        if (distinct) value.erase(unique(value.begin(), value.end()), value.end());
    }
    
    int size() {
        return value.size();
    }
    
    int val(int idx) {
        return value[idx];
    }
    
    int get(int v) {
        return lower_bound(value.begin(), value.end(), v) - value.begin();
    }
};

struct mint {
    const int mod = 1e9 + 7;
    long long x;
    
    mint (long long x = 0) : x((x % mod + mod) % mod) {
        
    }
    
    mint& operator=(const long long a) {
        x = a % mod;
        return *this;
    }
    
    mint& operator=(const mint a) {
        x = a.x % mod;
        return *this;
    }
    
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    
    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }
    
    mint& operator-=(const mint a) {
        if ((x += (mod - a.x)) >= mod) x -= mod;
        return *this;
    }
    
    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }
    
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    
    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }
    
    mint pow(long long t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    
    mint inv() const {
        return pow(mod - 2);
    }
    
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    
    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, k;
    cin >> n >> k;
    vector<ll> v;
    for(ll i = 1; (i * i) <= n; i++) {
        v.push_back(i);
        v.push_back(n / i);
    }
    Compress<ll> c(v, true);
    vector<mint> cnt(c.size());
    cnt[0] = c.val(0);
    reps(i, 1, c.size()) {
        cnt[i] = c.val(i) - c.val(i - 1);
    }
    vector<vector<mint>> dp(k, vector<mint>(c.size(), 0));
    rep(i, c.size()) dp[0][i] = cnt[i];
    reps(i, 1, k) {
        vector<mint> bdp(c.size() + 1, 0);
        rep(j, c.size()) bdp[j + 1] = bdp[j] + dp[i - 1][j];
        rep(j, c.size()) {
            ll v = c.val(j);
            dp[i][j] = cnt[j] * bdp[c.get(n / v + 1)];
        }
    }
    mint ans = 0;
    rep(i, c.size()) ans += dp[k - 1][i];
    cout << ans.x << endl;
    return 0;
}


Measured memory_bytes: 102520