#include<iostream>
#define int long long
using namespace std;
const int N=1e6+10;
int n,k,a[N],sum,ans;
//inline int read(){int x;cin>>x;return x;}
inline void dfs(int cnt)
{
	if(cnt==k)
	{
		if((n-sum)>=a[cnt-1])ans++;
		return;
	}
	for(int i=a[cnt-1];i<=(n-sum)/(k-cnt+1);i++)
	{
		a[cnt]=i;
		sum+=i;
		dfs(cnt+1);
		sum-=i;
	}
	return;
}
signed main()
{
	//ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;cin>>k;
	dfs(1);
	cout<<ans;
	return 0;
}