#pragma GCC optimize ("O3")
#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		x %= mod;
		this->x = x < 0 ? x+mod : x;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

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

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

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

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

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

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;}
typedef ModInt<1000000007> mint;



class ConvQuery {
	vector<mint> fac;
	vector<mint> facinv;

public:
	
	ConvQuery(int n) {
		fac = vector<mint>(n+1);
		facinv = vector<mint>(n+1);
		fac[0] = 1;
		facinv[0] = 1;
		for(int i = 0; i < n; ++i) {
			fac[i+1] = fac[i]*(i+1);
			facinv[i+1] = fac[i+1].inverse();
		}
	}

	mint operator()(int n, int m) {
		if(n >= 0 and 0 <= m and m <= n) return fac[n]*facinv[n-m]*facinv[m];
		else return 0;
	}
};

// int main() {
// 	int n;
// 	cin >> n;
// 	set<int> s;
// 	FOR(i, 1, n+1) {
// 		s.insert(n / i);
// 	}
// 	dpite(ALL(s));
// }

int main()
{
	ios_init();
	int n, k;
	while(cin >> n >> k) {
		set<LL> dvs;
		int pre = -1;
		FOR(i, 1, n + 1) {
			DEBUG(i);
			DEBUG(pre);
			if(pre == n / i) break;
			pre = n / i;
			dvs.insert(n / i);
		}
		{
			int t = pre;
			RFOR(i, 1, t) {
				dvs.insert(i);
			}
		}
		vector<LL> dv(ALL(dvs));
		vector<LL> dvn(SZ(dv));
		REP(i, SZ(dv)) {
			dvn[i] = n / dv[i] - n / (dv[i] + 1);
		}


		dpite(ALL(dv));
		dpite(ALL(dvn));
		reverse(ALL(dvn));
		assert(dv[0] == 1);

		vector<mint> dp(SZ(dv));
		dp[0] = 1;
		REP(_, k) {
			DEBUG(_);
			vector<mint> nex(SZ(dv) + 1);
			REP(i, SZ(dv)) {
				int r = lower_bound(ALL(dv), n / dv[i]) - dv.begin();
				nex[0] += dp[i];
				nex[r+1] -= dp[i];
			}
			REP(i, SZ(nex) - 1) {
				nex[i+1] += nex[i];
			}
			REP(i, SZ(dp)) {
				dp[i] = nex[i] * dvn[i];
			}
			dpite(ALL(dp));
		}
		mint ans = 0;
		REP(i, SZ(dp)) {
			ans += dp[i];
		}
		cout << ans << endl;
	}
	return 0;
}


// int main()
// {
// 	ios_init();
// 	int n, k;
// 	while(cin >> n >> k) {
// 		int len = sqrt(n) + 1;
// 		auto dp = make_v<mint>(2, k + 1, len);
// 		dp[0][0][1] = 1;

// 		vector<mint> cnt(sqrt(n) + 1);
// 		FOR(i, 1, SZ(cnt)) {
// 			cnt[i] = n / i - n / (i+1);
// 		}
// 		dpite(ALL(cnt));

// 		REP(i, k) {
// 			DEBUG(i);
// 			vector<mint> imos1(len + 1);
// 			vector<mint> imos2(len + 1);
// 			FOR(j, 1, len) {
// 				DEBUG(j);
// 				DEBUG(dp[0][i][j]);
// 				{
// 					dpite(ALL(imos1));
// 					dpite(ALL(imos2));
// 					imos1[0] += dp[0][i][j];
// 					imos1[len] -= dp[0][i][j];
// 					imos2[0] += dp[0][i][j];
// 					imos2[j + 1] -= dp[0][i][j];
// 					dpite(ALL(imos1));
// 					dpite(ALL(imos2));
// 				}
				
// 				{
// 					imos1[0] += dp[1][i][j];
// 					imos1[j + 1] -= dp[1][i][j];
// 				}
// 			}
// 			REP(i, len) imos1[i+1] += imos1[i];
// 			REP(i, len) imos2[i+1] += imos2[i];
			
// 			dpite(ALL(imos1));
// 			FOR(j, 1, len) {
// 				dp[0][i+1][j] = imos1[j];
// 				dp[1][i+1][j] = cnt[j] * imos2[j];
// 			}
// 		}
// 		REP(i, k+1) {
// 			DEBUG(i);
// 			dpite(ALL(dp[0][i]));
// 			dpite(ALL(dp[1][i]));
// 		}

// 		mint ans = 0;
// 		REP(j, len) ans += dp[0].back()[j] + dp[1].back()[j];
// 		cout << ans << endl;
// 	}
// 	return 0;
// }


Measured memory_bytes: 5264