// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const ll mod = 1e9 + 7;

template <typename T>
class SegmentTree {
public:
    ll size;
    vector<T> node;
    function<T(T, T)> comp;
    T identity_ele;  //comp(x, identity_ele) == x

    SegmentTree(const vector<T> &v, function<T(T, T)> comp, T identity_ele) 
        : comp(comp),
          identity_ele(identity_ele)
    {
        ll tmp = 1;
        while(tmp < v.size()) tmp = (tmp << 1);
        this->size = tmp;
        this->identity_ele = identity_ele;
        this->comp = comp;
        node = V<T>(2 * size - 1, identity_ele);
        for(ll i = 0; i < v.size(); i++) {
            node[i + size - 1] = v[i];
        }
        for(ll i = size - 2; 0 <= i; i--) {
            node[i] = comp(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }

    void update(ll pos, T value) {
        pos += size - 1;
        node[pos] = value;
        while(pos > 0) {
            pos = (pos - 1) / 2;
            node[pos] = comp(node[2 * pos + 1], node[2 * pos + 2]);
        }
    }

    T query(ll a, ll b) {
        return sub_query(a, b, 0, 0, size);
    }

    T sub_query(ll a, ll b, ll k, ll l, ll r) {
        if(r <= a || b <= l) {
            return identity_ele;
        } else if(a <= l && r <= b) {
            return node[k];
        } else {
            T left = sub_query(a, b, k * 2 + 1, l, (l + r) / 2);
            T right = sub_query(a, b, k * 2 + 2, (l + r) / 2, r);
            return comp(left, right);
        }
    }
};

int main() {
    ll N, K;
    cin >> N >> K;
    V<ll> range_left;
    for(ll i = 1; (i - 1) * (i - 1) <= N; i++) {
        range_left.push_back(N / i + 1);
        range_left.push_back(i);
    }

    V<ll> range_ok;
    range_left.push_back(N + 1);

    {
        sort(ALLR(range_left));
        auto ite = unique(ALL(range_left));
        range_left.erase(ite, range_left.end());
        if(range_left.back() == 0) range_left.pop_back();
        reverse(ALL(range_left));
    }

    for(ll i = 0; i < range_left.size() - 1; i++) {
        ll left = range_left[i], right = range_left[i + 1];
        ll ok = 1, ng = N + 1;
        while(ng - ok > 1) {
            ll mid = (ok + ng) / 2;
            if((right - 1) * mid <= N) ok = mid;
            else ng = mid;
        }
        DEBUG(PLL(left, ok));
        auto ite = upper_bound(ALL(range_left), ok);
        range_ok.push_back(distance(range_left.begin(), ite));
    }

    DEBUG(range_left);

    DEBUG(range_ok);

    V<ll> initv;
    for(ll i = 0; i < range_left.size() - 1; i++) {
        ll left = range_left[i];
        ll right = range_left[i + 1];
        initv.push_back(right - left);
    }

    DEBUG(initv);
    
    SegmentTree<ll> st(initv, [&](ll a, ll b) { return (a + b) % mod; }, 0);

    for(ll k__ = 1; k__ < K; k__++) {
        V<ll> initvk(range_left.size() + 1, 0);
        for(ll i = 0; i < range_left.size() - 1; i++) {
            ll idx = range_ok[i];
            ll range = range_left[i + 1] - range_left[i];
            ll sum = st.query(0, idx);
            DEBUG(range_left[i], range_ok[i], sum, sum * range);
            initvk[i] = sum * range % mod;
        }
        st = SegmentTree<ll>(initvk, [&](ll a, ll b) { return (a + b) % mod; }, 0);
    }

    cout << st.query(0, range_left.size()) << endl;
    return 0;
}



Measured memory_bytes: 6072