#include<iostream>
#include<vector>
#include<map>
#include<cassert>
using namespace std;
const long L=5354228880;
long l[25];
int K,N;
long fac[25];
long comb[25][25];
map<long,long>memo[25][25];
long dfs(int n,int k,long sum)
{
	if(l[n]*k<sum)return 0;
	if(n==N)return l[n]*k==sum;
	if(memo[n][k].find(sum)!=memo[n][k].end())return memo[n][k][sum];
	long ret=0;
	for(int i=0;i<=k&&l[n]*i+l[N]*(k-i)<=sum;i++)
	{
		ret+=comb[k][i]*dfs(n+1,k-i,sum-l[n]*i);
	}
	return memo[n][k][sum]=ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>K>>N;
	for(int i=0;i<=K;i++)
	{
		comb[i][0]=comb[i][i]=1;
		for(int j=1;j<i;j++)comb[i][j]=comb[i-1][j-1]+comb[i-1][j];
	}
	for(int n=1;n<=N;n++)l[n]=L/n;
	long v=dfs(1,K,L);
	cout<<v<<endl;
}