#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }
template<typename T>
bool isin(T y, T x, T h, T w) { return (0 <= y && 0 <= x && y < h && x < w); }
template<typename T>
bool isin1(T y, T x, T h, T w) { return (0 < y && 0 < x && y <= h && x <= w); }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	os << v[0];
	for (int i = 1; i < v.size(); i++) os << " " << v[i];
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u;
	return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}

template<typename T>
struct SegmentTree {

	T id;
	function<T(T, T)> op;
	vector<T> dat;
	int size;

	SegmentTree(int n, T id, function<T(T, T)> op) : id(id), op(op) {
		size = 1;
		while (size < n) size <<= 1;
		dat.assign(size * 2 + 10, id);
	}

	void update(int k, T x) {
		k += size, dat[k] = x;
		while (k > 1) k >>= 1, dat[k] = op(dat[k << 1], dat[(k << 1) | 1]);
	}

	void merge(int k, T x) { update(k, op(x, dat[k + size])); }
	//[a, b)
	T query(int a, int b) {
		T tl = id, tr = id;
		for (int l = a + size, r = b + size; l < r; l >>= 1, r >>= 1) {
			if (l & 1) tl = op(tl, dat[l++]);
			if (r & 1) tr = op(tr, dat[--r]);
		}
		return (op(tl, tr));
	}
};


void Main() {
	ll N, K; cin >> N >> K;
	ll n = floor(sqrt(N));

	vvvll dp(K, vvll(40000, vll(2, 0)));

	for (int i = 1; i <= n; i++) {
		dp[0][i][0] = i;
		//cout << "0 : " << dp[0][i][0] << endl;
	}
	vll nums(n+1, 0);

	ll pos = N;
	for (int i = 1; i <= n; i++) {
		if (i < n || n*n < N) {
			ll npos = N/(i+1);
			//cout << npos << endl;
			if (npos < n) npos = n;
			dp[0][i][1] = pos-npos;
			nums[i] = pos-npos;
			pos = npos;
		}
	}

	for (int i = n; i >= 1; i--) {
		(dp[0][i][1] += dp[0][i+1][1]) %= mod;
		//cout << "1 : " << i << " " << dp[0][i][1] << endl;
	}
	

	for (int i = 1; i < K; i++) {
		for (int j = 1; j <= n; j++) {
			(dp[i][j][0] += dp[i-1][n][0]) %= mod;
			(dp[i][j][0] += dp[i-1][j][1]) %= mod;
			(dp[i][j][0] += dp[i][j-1][0]) %= mod;
		}
		for (int j = n; j >= 1; j--) {
			if (j < n || n*n < N) {
				(dp[i][j][1] += nums[j] * dp[i-1][j][0]) %= mod;
				(dp[i][j][1] += dp[i][j+1][1]) %= mod;
			}
		}
	}
	cout << (dp[K-1][n][0] + dp[K-1][1][1]) % mod << endl;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout << fixed << setprecision(20);
	Main();
	return (0);
}


Measured memory_bytes: 221440