#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class Mint {
    using u64 = std::uint_fast64_t;
    u64 Modulus = MOD;

public:
    u64 a;

    constexpr Mint(const u64 x = 0) noexcept : a(x % Modulus) {}

    constexpr u64 &value() noexcept { return a; }

    constexpr const u64 &value() const noexcept { return a; }

    constexpr Mint operator+(const Mint rhs) const noexcept {
        return Mint(*this) += rhs;
    }

    constexpr Mint operator-(const Mint rhs) const noexcept {
        return Mint(*this) -= rhs;
    }

    constexpr Mint operator*(const Mint rhs) const noexcept {
        return Mint(*this) *= rhs;
    }

    constexpr Mint operator/(const Mint rhs) const noexcept {
        return Mint(*this) /= rhs;
    }

    constexpr Mint &operator+=(const Mint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }

    constexpr Mint &operator-=(const Mint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }

    constexpr Mint &operator*=(const Mint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }

    constexpr Mint &operator/=(Mint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }

    constexpr Mint &pow(int rhs) noexcept {
        u64 exp = static_cast<u64>(rhs);
        Mint base(a);
        a = 1;
        while (exp) {
            if (exp % 2) {
                *this *= base;
            }
            base *= base;
            exp /= 2;
        }
        return *this;
    }

};

class Solve {
public:
    Int N, K;

    void input() {
        cin >> N >> K;
    }

    void input(Int n, Int k) {
        N = n;
        K = k;
    }

    Int solve() {

        if (N <= 1) {
            if (N == 1) {
                cout << 1 << endl;
                return 1;
            }
            return -114514;
            // mini_prob
        } else {

            Int x = 1;
//            dp1.push_back(vector<Mint>());
            for (; x * x <= N; ++x) {
//                dp1.push_back(vector<Mint>());
            }
            if (x * x > N) x--;
            Int y = x;
            if (N / x - (N / (x + 1)) == 1 && N / x == x) {
                y--;
            }

//            for (int i = 0; i < x; ++i) {
//                dp2.push_back(vector<Mint>());
//            }

            vector<vector<Mint>> dp1(K + 1, vector<Mint>(x + 1));
            vector<vector<Mint>> dp2(K + 1, vector<Mint>(y + 1));
            dp1[0][1] = 1;

            for (int n = 0; n < K; ++n) {
                for (int i = 1; i <= x; ++i) {
//                    for (int k = 1; k <= x; ++k) {
//                        dp1[n + 1][i] += dp1[n][k];
//                        if (i <= k) {
//                            Int kei = (N / k - N / (k + 1));
//                            dp2[n + 1][k] += dp1[n][i] * kei;
//                        }
//                        if (k <= i) {
//                            if (i < x) {
//                                dp1[n + 1][k] += dp2[n][i];
//                            }
//                        }
//                    }

//                    Int kei = (N / k - N / (k + 1));
                    dp1[n + 1][1] += dp1[n][i];
                    if (i <= y)dp2[n + 1][i] += dp1[n][i];

                    if (i <= y)dp1[n + 1][1] += dp2[n][i];
                    if (i + 1 <= x && i <= y)dp1[n + 1][i + 1] -= dp2[n][i];
                }

                for (int i = 1; i + 1 <= x; ++i) {
                    dp1[n + 1][i + 1] += dp1[n + 1][i];
                }
                for (int i = 1; i < y; ++i) {
                    dp2[n + 1][i + 1] += dp2[n + 1][i];
                }
                for (Int k = 1; k <= y; ++k) {
                    Int kei = (N / k - N / (k + 1));
                    dp2[n + 1][k] *= kei;
                }

            }

            Mint ans = 0;
            for (int i = 1; i <= x; ++i) {
                ans += dp1[K][i];
            }
            for (int i = 1; i <= y; ++i) {
                ans += dp2[K][i];
            }
            cout << ans.value() << endl;

            return ans.value();
        }

    }

    Int fool() {
        vector<vector<Mint>> dp(K + 1, vector<Mint>(N + 1, 0));
        dp[0][1] = 1;

        for (int i = 0; i < K; ++i) {
            for (int j = 1; j <= N; ++j) {
                for (int k = 1; k <= N; ++k) {
                    if (j * k <= N) {
                        dp[i + 1][k] += dp[i][j];
                    }
                }
            }
        }

        Mint ans = 0;
        for (int i = 1; i <= N; ++i) {
            ans += dp[K][i];
        }
        cout << ans.value() << endl;
        return ans.value();
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    bool debug = false;
//    debug = true;

    if (!debug) {
        Solve solve;
        solve.input();
        solve.solve();
    } else {
        while (true) {
            Solve solve, fool;

            Int N = rand() % 5 + 1;
            Int K = rand() % 5 + 2;

//            Int N = 314159265;
//            Int K = 35;


            cout << N << " " << K << endl;

            solve.input(N, K);
            fool.input(N, K);

            if (solve.solve() != fool.fool()) {
                exit(-1);
            }
        }

    }

//    Solve().solve();

//    for (Int N = 114514; N < 114524; ++N) {
//        cout << N << endl;
//        int x = 0;
//        for (; x * x <= N; ++x) {
//        }
//        if (x * x > N) x--;
//
//        for (int i = 1; i <= x; ++i) {
//            Int L = N / (i + 1) + 1;
//            Int R = N / i;
//            cout << i << " " << L << " " << R << endl;
//        }
//    }


    return 0;
}


Measured memory_bytes: 101128