#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 35
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define mem(x) memset(x,0,sizeof(x));
using namespace std;
int T,n,m,f[N][N],k,ans,op,x,y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int pr(int x){x--;if(x<1)x=n;return x;}
int ne(int x){x++;if(x>n)x=1;return x;}
signed main(){
	freopen("ballg.in","r",stdin);freopen("ballg.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	f[0][1]=1;
	fo(i,0,m-1)
		fo(j,1,n)
			f[i+1][pr(j)]+=f[i][j],
			f[i+1][ne(j)]+=f[i][j];
	cout<<f[m][1];
	return 0;
}