#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}

template <typename T>
set<T> factors(T a) {
    set<T> facs;
    for (T i = 1; i * i <= a; ++i) {
        //        if (a % i == 0) {
        facs.insert(i);
        facs.insert(a / i);
        //        }
    }
    return facs;
}

struct mint {
    ll v;
    ll mod;
    mint() : v(0) {}
    mint(signed v, ll mod = MOD) : v(v), mod(mod) {}
    mint(ll t, ll mod = MOD) : mod(mod) {
        v = t % mod;
        if (v < 0)
            v += mod;
    }

    mint pow(ll k) {
        mint res(1), tmp(v);
        while (k) {
            if (k & 1)
                res *= tmp;
            tmp *= tmp;
            k >>= 1;
        }
        return res;
    }

    static mint add_identity() { return mint(0); }
    static mint mul_identity() { return mint(1); }

    mint inv() { return pow(mod - 2); }

    mint &operator+=(mint a) {
        v += a.v;
        if (v >= mod)
            v -= mod;
        return *this;
    }
    mint &operator-=(mint a) {
        v += mod - a.v;
        if (v >= mod)
            v -= mod;
        return *this;
    }
    mint &operator*=(mint a) {
        v = 1LL * v * a.v % mod;
        return *this;
    }
    mint &operator/=(mint a) { return (*this) *= a.inv(); }

    mint operator+(mint a) const { return mint(v) += a; };
    mint operator-(mint a) const { return mint(v) -= a; };
    mint operator*(mint a) const { return mint(v) *= a; };
    mint operator/(mint a) const { return mint(v) /= a; };

    mint operator-() const { return v ? mint(MOD - v) : mint(v); }

    bool operator==(const mint a) const { return v == a.v; }
    bool operator!=(const mint a) const { return v != a.v; }
    bool operator<(const mint a) const { return v < a.v; }
};

int main() {
    ll n, k;
    cin >> n >> k;
    set<ll> facsset = factors(n);
    vector<ll> facs;
    for (auto &f : facsset) {
        facs.push_back(f);
    }
    int m = facs.size();
    // cout << m << "\n";
    vector<vector<mint>> dp(
        k, vector<mint>(m, 0)); // used nth digit, last digit is below mth factor
    dp[0][0] = 1;
    for (int i = 1; i < m; ++i) {
        dp[0][i] = facs[i] - facs[i - 1];
    }
    vector<vector<mint>> sum(k, vector<mint>(m, 0));
    sum[0][0] = 1;
    for (int i = 1; i < m; ++i) {
        sum[0][i] = sum[0][i - 1] + dp[0][i];
    }

    for (int i = 1; i < k; ++i) {
        for (int j = 0; j < m; ++j) {
            ll fac = n / facs[j];
            int idx = lower_bound(facs.begin(), facs.end(), fac) - facs.begin();
            dp[i][j] = (facs[j] - (j == 0 ? 0 : facs[j - 1]));
            dp[i][j] *= sum[i - 1][idx]; // - (idx == 0 ? 0 : sum[i - 1][idx - 1]);
        }
        sum[i][0] = dp[i][0];
        for (int j = 1; j < m; ++j) {
            sum[i][j] = sum[i][j - 1] + dp[i][j];
        }
    }
    mint ret = 0;
    for (int i = 0; i < m; ++i) {
        ret += dp[k - 1][i];
    }
    cout << ret.v << "\n";
    return 0;
}

Measured memory_bytes: 202780