#include <fstream>
using namespace std;
ifstream fin("ballg.in");
ofstream fout("ballg.out");
int m,n,jishu=0,kid[100],i,step=0;
int dfs(int x)
{
	if(step==m)
	{
		if(kid[x]==kid[1])
			jishu++;
		return 0;
	}
	else
	{
		if(x+1>=1&&x+1<=n)
		{
			step++;
			dfs(x+1);
			step--;
		}
		if(x-1>=1&&x-1<=n)		
		{
			step++;
			dfs(x-1);
			step--;
		}
		if(x+1<1||x+1>n)
		{
			step++;
			dfs((x+1+n)%n);
			step--;
		}
		if(x-1<1||x-1>n)
		{
			step++;
			dfs((x+1+n)%n);
			step--;
		}
	}
	return 0;
}
int main()
{
	fin>>n>>m;
	for(i=1;i<=n;i++)
	{
		kid[i]=i;
	}
	dfs(1);
	fout<<jishu<<endl;
	fin.close();
	fout.close();
	return 0;
}