#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read()
{ll s=0;bool f=0;char ch=' ';while(!isdigit(ch)){f|=(ch=='-');ch=getchar();}while(isdigit(ch)){s=(s<<3)+(s<<1)+(ch^48);ch=getchar();}return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{if(x<0){putchar('-');x=-x;}if(x<10){putchar(x+'0');return;}write(x/10);putchar((x%10)+'0');return;
}
inline void writeln(ll x)
{write(x);putchar('\n');return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) writeln(x)
const int N=15;
int n,m,Ges[(1<<10)+5];
ll dp[N][N*N][(1<<10)+5];
bool Can[(1<<10)+5][(1<<10)+5],Jud[(1<<10)+5];
int main()
{int i,j,k,ii,jj;R(n); R(m);for(i=0;i<(1<<n);i++){bool bo=1;for(j=2;j<=n&&bo;j++) if((i&(1<<(j-2)))&&(i&(1<<(j-1)))) bo=0;Jud[i]=bo;}for(i=0;i<(1<<n);i++) if(Jud[i]){for(j=0;j<(1<<n);j++) if(Jud[j]){bool bo=1;if(i&(1<<(1-1))) if((j&(1<<(1-1)))||(j&(1<<(2-1)))) bo=0;for(k=2;k<n&&bo;k++) if(i&(1<<(k-1))){if((j&(1<<(k-2)))||(j&(1<<(k-1)))||(j&(1<<(k)))) bo=0;}if(i&(1<<(n-1))) if((j&(1<<(n-2)))||(j&(1<<(n-1)))) bo=0;if(bo)    Can[i][j]=1;}}for(i=0;i<(1<<n);i++){Ges[i]=0;for(j=1;j<=n;j++) if(i&(1<<(j-1))) Ges[i]++;dp[1][Ges[i]][i]=1;}for(i=2;i<=n;i++){for(j=0;j<=m;j++){for(ii=0;ii<(1<<n);ii++) if(dp[i-1][j][ii]&&Jud[ii]){for(jj=0;jj<(1<<n);jj++) if(Can[ii][jj]&&j+Ges[jj]<=m&&Jud[jj]){dp[i][j+Ges[jj]][jj]+=dp[i-1][j][ii];}}}}ll ans=0;for(i=0;i<(1<<n);i++) ans+=dp[n][m][i];Wl(ans);return 0;
}
/*
input
3 2
output
16input
4 4
output
79
*/