//code by lynmisakura.wish to be accepted!
/*************************/
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
#include<set>
#include<bitset>
using namespace std;
/***************************/
typedef long long ll;
typedef long long ijt;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;

const long long INF = 1LL << 55;

#define itn int
#define endl '\n'
#define pb push_back
#define mp make_pair
#define ss second
#define ff first
#define dup(x,y) ((x) + (y) - 1)/(y)
#define mins(x,y) x = min(x,y)
#define maxs(x,y) x = max(x,y)
#define all(x) (x).begin(),(x).end()
#define Rep(n) for(int i = 0;i < n;i++)
#define rep(i,n) for(int i = 0;i < n;i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )

ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll qp(ll a, ll b) { ll ans = 1; do { if (b & 1)ans = 1ll * ans*a; a = 1ll * a*a; } while (b >>= 1); return ans; }
ll qp(ll a, ll b, int mo) { ll ans = 1; do { if (b & 1)ans = 1ll * ans*a%mo; a = 1ll * a*a%mo; } while (b >>= 1); return ans; }

#define _GLIBCXX_DEBUG
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
//mint
const int mod = 1e9 + 7;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x(x%mod) {}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};

mint dp[110][32000]; //i個並べる、左端はj
int main() {
	
	int n,k;cin >> n >> k; //積n以下、k個並べる
	int m = (int)sqrt(n);
	vector<int> b;
	for (int i = 1; i <= m; i++) {
		b.pb(i);
		b.pb(n/i);
	}
	sort(all(b));UNIQUE(b);
	int s = b.size();

	//例:10... {1,2,3,5,10} -> {1,1,1,2,5}
	vector<int> d;//[n/i]がいくつ重複するか
	bool first = true; int pre;
	for (auto i : b) {
		if (first) {
			d.pb(i);pre = i;
			first = false;
		}
		else {
			d.pb(i - pre);pre = i;
		}
	}
	
	//dp[i][j]はdp[i-1][s+1-j]までの累積和
	//dが0-indexであることに注意！
	
	//i == 1に埋めておく
	for (int j = 1; j <= s; j++) {
		//cout << b[j-1] << " ";
		dp[1][j] = (mint)((n / b[j-1]));
		//cout << dp[1][j].x << " ";
	}
	//cout << endl;
	//i >= 2
	for (int i = 2; i <= k + 1; i++) {
		//jまでの累積和を作る
		vector<mint> cum;
		cum.pb(0);
		for (int j = 1; j <= s; j++) {
			cum.pb(cum[j-1] + (mint)d[j - 1] * dp[i-1][j]);
		}
		//dp[i][]を埋める
		for (int j = 1; j <= s; j++) {
			dp[i][j] = cum[s+1-j];
		}
	}
	/*for (int i = 1; i <= k + 1; i++) {
		for (int j = 1; j <= s; j++) {
			cout << dp[i][j].x << " ";
		}
		cout << endl;
	}*/
	cout << dp[k][1].x << endl;
}

Measured memory_bytes: 29952