#include<bits/stdc++.h>
#define reg register
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int n,m,a[1005][1005],ans;
void dfs(reg int x,reg int y)
{
	if(x==m&&y==n)
	{
		ans++;
		return;
	}
	if(!a[x+2][y+1]&&x+2<=m&&y+1<=n)
	{
		a[x+2][y+1]=1;
		dfs(x+2,y+1);
		a[x+2][y+1]=0;
	}
	if(!a[x+1][y+2]&&x+1<=m&&y+2<=n)
	{
		a[x+1][y+2]=1;
		dfs(x+1,y+2);
		a[x+1][y+2]=0;
	}
	if(!a[x+2][y-1]&&x+2<=m&&y-1>=0)
	{
		a[x+2][y-1]=1;
		dfs(x+2,y+1);
		a[x+2][y-1]=0;
	}
	if(!a[x+1][y-2]&&x+1<=m&&y-2>=0)
	{
		a[x+1][y-2]=1;
		dfs(x+1,y-2);
		a[x+1][y-2]=0;
	}
}
int main()
{
	cin>>n>>m;
	dfs(0,0);
	cout<<ans;
}

(退役蒟蒻前来怀古伤今qwq)