#include <cstdio>
#include <cstring>

using namespace std;

int chess[20][20];
int n,m;

int dfs(int i,int j)
{
    if(chess[i][j]>0||j==0) return chess[i][j];
    if(i>=1&&j-2>=0) chess[i][j]+=dfs(i-1,j-2);
    if(i>=2&&j-1>=0) chess[i][j]+=dfs(i-2,j-1);
    if(i+1<m&&j-2>=0) chess[i][j]+=dfs(i+1,j-2);
    if(i+2<m&&j-1>=0) chess[i][j]+=dfs(i+2,j-1);
    return chess[i][j];
}

int main()
{
	freopen("horse.in","r",stdin);
	freopen("horse.out","w",stdout);
	
    scanf("%d%d",&m,&n);
    memset(chess,0,sizeof(chess));
    chess[0][0]=1;
    int cnt=dfs(m-1,n-1);
    printf("%d\n",cnt);
    
    fclose(stdin);
    fclose(stdout);
    
    return 0;
}