#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
#include <cstring>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template<int mod>
struct ModInt{
    int x;

    ModInt() : x(0) {}
    
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    
    ModInt &operator-=(const ModInt &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p){
        *this *= p.inverse();
        return *this;
    }
    
    ModInt operator-() const {return ModInt(-x);}

    ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}

    ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}

    ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}

    ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

    bool operator==(const ModInt &p) const {return x == p.x;}

    bool operator!=(const ModInt &p) const {return x != p.x;}

    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0){
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const{
        ModInt ret(1), mul(x);
        while(n > 0){
            if(n & 1)   ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p){
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a){
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() {return mod;}
};

using modint = ModInt<mod>;

modint dp[105][40005], dp2[105][40005];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    if(N == 1){
        cout << 1 << endl;
        return 0;
    }

    int bound = 1;
    while((ll)bound * bound <= N)   ++bound;
    --bound;
    vector<int> val(bound + 1);
    for(int i = 1; i <= bound; ++i) val[i] = N / i;

    dp[0][1] = 1;
    for(int i = 1; i < bound; ++i)  dp[0][i + 1] += dp[0][i];
    if(val.back() == bound){
        for(int i = 0; i < K; ++i){
            for(int j = 1; j <= bound; ++j){
                dp[i + 1][j] = dp[i][bound] + dp2[i][j];
                if(j < bound)   dp2[i + 1][j] = dp[i][j] * (val[j] - val[j + 1]);
            }
            for(int j = 1; j < bound; ++j)  dp[i + 1][j + 1] += dp[i + 1][j];
            for(int j = bound - 1; j > 1; --j)  dp2[i + 1][j - 1] += dp2[i + 1][j];
        }
    }
    else{
        val.emplace_back(bound);
        for(int i = 0; i < K; ++i){
            for(int j = 1; j <= bound; ++j){
                dp[i + 1][j] = dp[i][bound] + dp2[i][j];
                dp2[i + 1][j] = dp[i][j] * (val[j] - val[j + 1]);
            }
            for(int j = 0; j < bound; ++j)  dp[i + 1][j + 1] += dp[i + 1][j];
            for(int j = bound; j > 1; --j)  dp2[i + 1][j - 1] += dp2[i + 1][j];
        }
    }
    cout << dp[K][bound] + dp2[K][1] << endl;
}

Measured memory_bytes: 36548