#include<iostream>
using namespace std;
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
int f[21][21];
int main(){
    freopen("horse.in","r",stdin),freopen("horse.out","w",stdout);
    short i,j,m,n;
    scanf("%hd%hd",&m,&n);
    f[1][1]=1;
    for(i=2;i<=n;++i)
        for(j=1;j<=m;++j){
            if(j+2<=m)f[i][j]+=f[i-1][j+2];
            if(j-2>0)f[i][j]+=f[i-1][j-2];
            if(i-2>0&&j-1>0)f[i][j]+=f[i-2][j-1];
            if(i-2>0&&j+1<=m)f[i][j]+=f[i-2][j+1];
        }
    printf("%d",f[n][m]);
}