#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>

using namespace std;
using ll = long long;

void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> istream& operator>>(istream &is, pair<S, T> &p){ return is >> p.first >> p.second; }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ return os << "[" << p.first << ", " << p.second << "]"; }

#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define For1(i, n) for(int i = 1; i <= (n); i ++)
#define Rof(i, n) for(int i = (n)-1; i >= 0; i --)
#define Rof1(i, n) for(int i = (n); i >= 1; i --)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
#define Return(x) { Cout(x); return 0; }

constexpr int MOD = 1e9+7;

template<int M> struct Mint{
    ll x;
    Mint(ll x) : x(x % M){}
    Mint() : Mint<M>(0){}
};
template<int M> istream& operator>>(istream &is, Mint<M> &m){ return is >> m.x; }
template<int M> ostream& operator<<(ostream &os, const Mint<M> &m){ return os << m.x; }
template<int M> Mint<M> operator+(const Mint<M> &m, const Mint<M> &n){ return m.x + n.x; }
template<int M> Mint<M> operator-(const Mint<M> &m, const Mint<M> &n){ return m.x + (M - n.x); }
template<int M> Mint<M> operator*(const Mint<M> &m, const Mint<M> &n){ return m.x * n.x; }
template<int M> Mint<M> operator+(const Mint<M> &m, const int &n){ return m + Mint<M>(n); }
template<int M> Mint<M> operator-(const Mint<M> &m, const int &n){ return m - Mint<M>(n); }
template<int M> Mint<M> operator*(const Mint<M> &m, const int &n){ return m * Mint<M>(n); }

int main(void){
    Cin(int, n, k);
    
    int sn = floor(sqrt(n));
    vc<int> ix;
    For1(i, sn){
        ix.push_back(i);
        if(i != n/i) ix.push_back(n/i);
    }
    Sort(ix);
    int nx = (int)ix.size();
    vc<int> il(nx);
    For(i, nx) il[i] = ix[i] - (i > 0 ? ix[i-1] : 0);
    
    vc<vc<Mint<MOD>>> dp(k+1, vc<Mint<MOD>>(ix.size(), 0));
    dp[0][0] = 1;
    For1(i, k){
        Mint<MOD> acc = 0;
        For(j, nx){
            acc = acc + dp[i-1][j] * il[j];
            dp[i][nx-1 - j] = acc;
        }
    }
    
    // For(i, k+1) Couts(dp[i]);
    
    Mint<MOD> ans = 0;
    For(i, nx) ans = ans + dp[k][i] * il[i];
    Cout(ans);
    
}


Measured memory_bytes: 51452