import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //
void solve(){
	long n = read.to!long;
	int k = read.to!int;
	
	long rn = sqrt(n.to!real).to!long;
	log("n:", n, "k:", k, "rn:", rn);
	
	Finite[] qs = [Finite(0)];
	foreach(j; 1 .. rn + 1) qs ~= Finite((n / j) - rn);
	log("qs:", qs);
	
	Finite[][] xs, us, vs;
	foreach(i; 0 .. k){
		Finite[] xq = [Finite(0)], uq = [Finite(0)], vq = [Finite(0)];
		xs ~= xq, us ~= uq, vs ~= vq;
		foreach(j; 1 .. rn + 1){
			Finite x = Finite(0);
			if(i == 0) x += 1;
			else if(i == 1) x += us[i - 1][rn] + qs[j];
			else if(i >= 2) x += us[i - 1][rn] + us[i - 2][j - 1] * qs[j] + vs[i - 2][rn] - vs[i - 2][j - 1];
			
			log("i:", i, "j:", j, "xs:", xs, "us:", us, "vs:", vs);
			us[i] ~= us[i][j - 1] + x;
			vs[i] ~= vs[i][j - 1] + x * qs[j];
			xs[i] ~= x;
		}
	}
	log("xs:", xs, "us:", us, "vs:", vs);
	
	Finite ans = us[k - 1][rn] + vs[k - 2][rn];
	ans.writeln;
}

/*
rn := sqrt(n) 以下の数が最低でも1個おきには出る。
qs[j]: 「t > rn かつ j * t <= n」 であるtの個数

xs[i][j] : i番目がjであるやり方の数（j <= sqrt(n)）

xs[i][j] = sum(j'; 0 .. rn + 1) xs[i - 1][j']
	+ sum(j'; 0 .. j) xs[i - 2][j'] * qs[j] + sum(j'; j .. rn + 1) xs[i - 2][j'] * qs[j']

これを計算するために

us[i][j] = sum(j'; 0 .. j + 1) xs[i][j]
vs[i][j] = sum(j'; 0 .. j + 1) xs[i][j] * qs[j]

すると

xs[i][j] = us[i - 1][rn] +us[i - 2][j - 1] * qs[j] + vs[i - 2][rn] - vs[i - 2][j - 1]

求めるものは us[k - 1][rn] + vs[k - 2][rn]


*/
struct Finite{ ulong value; static ulong mod = 1_000_000_007;
	private static ulong[] _inv = [0, 1], _frac = [1, 1], _invfrac = [1, 1];
	this(ulong v){ value = v % mod; }
	bool opCast(T: bool)(){ return value != 0; }
	Finite opUnary(string s){ ulong v;
		if(s == "+") v = value;
		else if(s == "-") v = mod - value;
		else if(s == "++") v = value + 1;
		else if(s == "--") v = value + mod - 1;
		else assert(0, "Operator unary " ~ s ~ " not implemented");
		return Finite(v);
	}
	Finite opBinary(string s)(Finite b){
		return opBinary!s(b.value);
	}
	Finite opBinary(string s)(ulong u){ ulong v;
		if(s == "+") v = value + u;
		else if(s == "-") v = value + mod - u;
		else if(s == "*") v = value * u;
		else if(s == "/") v = value * inv(u);
		else assert(0, "Operator " ~ s ~ " not implemented");
		return Finite(v);
	}
	Finite opBinaryRight(string s)(ulong u){ ulong v;
		if(s == "+") v = u + value;
		else if(s == "-") v = u + mod - value;
		else if(s == "*") v = u * value;
		else if(s == "/") v = u * invvalue;
		else assert(0, "Operator " ~ s ~ " not implemented");
		return Finite(v);
	}
	Finite opAssign(ulong v){ value = v; return this; }
	Finite opOpAssign(string s)(Finite b){
		return opOpAssign!s(b.value);
	}
	Finite opOpAssign(string s)(ulong v){
		if(s == "+") value = (value + v) % mod;
		else if(s == "-") value = (value + mod - v) % mod;
		else if(s == "*") value = (value * v) % mod;
		else if(s == "/") value = (value * inv(v)) % mod;
		else assert(0, "Operator " ~ s ~ "= not implemented");
		return this;
	}
	bool opEquals(Finite b){
		return(value == b.value);
	}
	string toString(){ return value.to!string; }
	ulong inv(ulong v){
		assert(v > 0);
		assert(v < mod);
		while(v >= _inv.length){
			_inv ~= _inv[mod % $] * (mod - mod / _inv.length) % mod;
		}
		return _inv[v];
	}
	ulong invvalue(){
		return inv(value);
	}
	static Finite opCall(ulong v){
		return Finite(v);
	}
}
