#include"bits/stdc++.h"

 #define db double

 #define ll long long

 #define vec vector<ll>

 #define Mt  vector<vec>

 #define ci(x) scanf("%d",&x)

 #define cd(x) scanf("%lf",&x)

 #define cl(x) scanf("%lld",&x)

 #define pi(x) printf("%d\n",x)

 #define pd(x) printf("%f\n",x)

 #define pl(x) printf("%lld\n",x)

 //#define rep(i, x, y) for(int i=x;i<=y;i++)

 #define rep(i,n) for(int i=0;i<n;i++)

 const int N   = 1e5+;

 const int mod = 1e9 + ;

 const int MOD = mod - ;

 const int inf = 0x3f3f3f3f;

 const db  PI  = acos(-1.0);

 const db  eps = 1e-;

 using namespace std;

 int n,m;

 int sum[N];

 int s[N];

 ll f[][][];

 int id=;

 int cal(int x){

     int ans=;

     while(x) ans+=x&,x>>=;

     return sum[id]=ans;

 }

 int main(){

     ci(n),ci(m);

     int x=(<<n);

     for(int i=;i<x;i++) if(!(i&(i<<))) f[][++id][cal(i)]=,s[id]=i;//预处理一行内不冲突的情况

     for(int i=;i<=n;i++){

         for(int j=;j<=id;j++){

             for(int k=;k<=id;k++){

                 if((s[j]&s[k])||(s[j]&(s[k]>>))||(s[j]&(s[k]<<))) continue;//前后两行不冲突

                 for(int l=;l+sum[j]<=m;l++) f[i][j][l+sum[j]]+=f[i-][k][l];

             }

         }

     }

     ll ans=;

     for(int i=;i<=id;i++) ans+=f[n][i][m];//累加

     pl(ans);

     return ;

 }