#include <bits/stdc++.h>

using namespace std;

const int OO = 1e9;
const double EPS = 1e-9;

#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __LINE__  \
		<< ": "; _db(#__VA_ARGS__, __VA_ARGS__);})
#define RNG() rng()
#else
#define db(...) true
#define RNG() true
#endif

template<class T>
void _db(const char *dbStr, T e) {
	cout << dbStr << " = " << e << endl;
}
template<class T, class... L>
void _db(const char *dbStr, T e, L... r) {
  while(*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ','; _db(dbStr + 1, r...);
}
template<class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
	o << "["; int i = 0;
	for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
	<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}
template<class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
	return o << "(" << pr.fs << ", " << pr.sc << ")";
}
ostream& operator<<(ostream& o, const string& s) {
	for (const char& c : s) o << c;
	return o;
}

template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;


const int MX = 1000000005, MOD = 1000000007;
const int MX_SQRT = 2 * sqrt(MX) + 5;

int N, K, N_SQRT, mem[105][MX_SQRT], sum[105][MX_SQRT], go[MX_SQRT];
mii ord, ordInv, M;


ll add(ll x, ll y) {
    x += y;
    while(x >= MOD)
        x -= MOD;
    while(x < 0)
        x += MOD;
    return x;
}

ll mul(ll x, ll y) {
    return (x * y) % MOD;
}

int dp(int idx, int prevID) {
	if (idx == K)
		return 1;
	int& ret = mem[idx][prevID];

	if (ret != -1)
		return ret;

	ret = 0;
	int nDivPrev = ordInv[prevID];
	db(idx, prevID, nDivPrev);
//	for (int i = 1; i <= nDivPrev; ++i) {
//		ret += dp(idx + 1, ord[N / i]);
//	}


//	for (auto& pr : M) {
//		if (pr.fs >= N / nDivPrev)
//			ret += dp(idx + 1, ord[pr.fs]) * M[pr.fs];
//	}
	return ret;

}

int main() {
	#ifdef LOCAL
	auto stTime = clock();
	freopen("in.txt", "r", stdin);
	mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	ios::sync_with_stdio(false);
	cout.precision(10);
	cin.tie(0);

	cin >> N >> K;

	for (N_SQRT = 1;; ++N_SQRT) {
		if (N_SQRT * 1LL * N_SQRT > N)
			break;
	}

	--N_SQRT;

	db(N_SQRT);



	for (int t = 1; t <= N_SQRT; ++t) {
		M[t] = N / t - N / (t + 1);
	}

	db(sz(M), N_SQRT);

//	db((M));

	for (int i = 1; i <= N_SQRT; ++i) {
		if (N / i > N_SQRT)
			++M[N / i];
	}

//	db(M);

	assert(sz(M) < MX_SQRT);

	db(sz(M));

	int id = 0;
	for (auto& pr : M) {
		ord[pr.fs] = id;
		ordInv[id++] = pr.fs;
	}

//	memset(mem, -1, sizeof(mem));
//
//	cout << dp(0, ord[N]);


	for (auto& pr : ordInv) {
		// for every pr.fs (id1), find
		// the first id2 s.t. ordInv[id2] >= N / ordInv[id1]
		int id1 = pr.fs;
		int lo = 0, hi = sz(M) - 1;

		while (lo < hi) {
			int id2 = (lo + hi) / 2;
			if (ordInv[id2] >= N / ordInv[id1])
				hi = id2;
			else
				lo = id2 + 1;
		}

		assert(lo >= 0 && lo < sz(M));

		go[id1] = lo;
	}

	for (int i = sz(M) - 1; i >= 0; --i) {
		mem[K][i] = 1;
		sum[K][i] = add(sum[K][i + 1], mul(M[ordInv[i]], mem[K][i]));
	}

	for (int idx = K - 1; idx >= 0; --idx) {
		for (int prevID = sz(M) - 1; prevID >= 0; --prevID) {
			int& ret = mem[idx][prevID];
			int nDivPrev = ordInv[prevID];
//			db(idx, prevID, nDivPrev);


//			for (int i = 1; i <= nDivPrev; ++i) {
//				ret += mem[idx + 1][ord[N / i]];
//			}
//			for (auto& pr : M) {
//				if (pr.fs >= N / nDivPrev)
//					ret += mem[idx + 1][ord[pr.fs]] * M[pr.fs];
//			}
			ret = sum[idx + 1][go[prevID]];


			sum[idx][prevID] = add(sum[idx][prevID + 1], mul(mem[idx][prevID], M[ordInv[prevID]]));
		}
	}

	cout << mem[0][ord[N]] << '\n';


	#ifdef LOCAL
	cout << "\n\n\nExecution time: " <<
		(clock() - stTime) * 1e3 / CLOCKS_PER_SEC << " ms" << endl;
	#endif
    return 0;
}


Measured memory_bytes: 60288