#include <iostream>
#include <vector>
#include <map>
using namespace std;
#define mod 1000000007
map<int,int> m;
vector<pair<int,int> > g;
long long dp[105][100005];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;)
	{
		int f=n/i,r=n/f;
		g.push_back({i,r});
		m[r]=g.size();
		dp[1][g.size()]=dp[1][g.size()-1]+r-i+1;
		i=r+1;
	}
	for (int i=2;i<=k;i++)
	{
		for (int j=1;j<=g.size();j++)
		dp[i][j]=(dp[i][j-1]+dp[i-1][m[n/g[j-1].first]]*(g[j-1].second-g[j-1].first+1))%mod;
	}
	printf("%lld",dp[k][g.size()]);
}