#include<stdio.h>  
#include<string.h>    
int dp[110][110];  
int m,n;  
int solve(int i,int j)
{  
    if(i<1||j<1||i>m||j>n) 
		return 0;  
    if(i==1&&j==1) 
		return 1;  
    if(dp[i][j]>0)  
		return dp[i][j];  
    dp[i][j]=solve(i-2,j-1)+solve(i+2,j-1)+solve(i-1,j-2)+solve(i+1,j-2);  
    return dp[i][j];  
}  
int main()
{   
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout); 
    while(fscanf(stdin,"%d%d",&m,&n)!=EOF)
	{  
    	memset(dp,0,sizeof(dp));  
    	fprintf(stdout,"%d\n",solve(m,n));  
    }  
    fclose(stdin);
	fclose(stdout);
    return 0;  
}