#include<stdio.h>

int f[35][35]={0};

int main ()
{
	int n,m,ans;
	scanf ("%d%d",&n,&m);
	f[0][0]=1; 
	for (int i=1;i<=m;i++)
		for (int j=0;j<n;j++)
			f[i][j]=f[i-1][(j-1+n)%n]+f[i-1][(j+1)%n];
	ans=f[m][0];
	printf ("%d\n",ans);
	return 0;
}

/**************************************************************
	Problem: 2278
	User: admin
	Language: C
	Result: Accepted
	Time:49 ms
	Memory:1148 kb
****************************************************************/