#include<bits/stdc++.h>

#define de(x) cout<<#x<<"="<<x<<endl;

#define dd(x) cout<<#x<<"="<<x<<" ";

#define rep(i,a,b) for(int i=a;i<(b);++i)

#define repd(i,a,b) for(int i=a;i>=(b);--i)

#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)

#define ll long long

#define mt(a,b) memset(a,b,sizeof(a))

#define fi first

#define se second

#define inf 0x3f3f3f3f

#define INF 0x3f3f3f3f3f3f3f3f

#define pii pair<int,int>

#define pdd pair<double,double>

#define pdi pair<double,int>

#define mp(u,v) make_pair(u,v)

#define sz(a) (int)a.size()

#define ull unsigned long long

#define ll long long

#define pb push_back

#define PI acos(-1.0)

#define qc std::ios::sync_with_stdio(false)

#define db double

#define all(a) a.begin(),a.end()

const int mod = 1e9+;

const int maxn = 1e5+;

const double eps = 1e-;

using namespace std;

bool eq(const db &a, const db &b) { return fabs(a - b) < eps; }

bool ls(const db &a, const db &b) { return a + eps < b; }

bool le(const db &a, const db &b) { return eq(a, b) || ls(a, b); }

ll gcd(ll a,ll b) { return a==?b:gcd(b%a,a); };

ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }

ll kpow(ll a,ll b) {ll res=;a%=mod; if(b<) return ; for(;b;b>>=){if(b&)res=res*a%mod;a=a*a%mod;}return res;}

ll read(){

    ll x=,f=;char ch=getchar();

    while (ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while (ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

//inv[1]=1;

//for(int i=2;i<=n;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;

int n,k;

ll dp[][][];

int dx[] = {,,,-,-,-,,};

int dy[] = {,-,,,-,,-,};

bool ok(int pre,int now){

    int arr[][] = {};

    rep(i,,n+) arr[][i] = (pre&(<<(i-)));

    rep(i,,n+) arr[][i] = (now&(<<(i-)));

    rep(i,,) {

        rep(j,,n+){

            if(arr[i][j]){

                int x = i, y = j;

                rep(t,,){

                    int nx = x + dx[t],ny = y + dy[t];

                    if(arr[nx][ny]) return false;

                }

            }

        }

    }

    return true;

}

int bit(int s){

    bitset<> ans(s);

    return ans.count();

}

int main(){

    scanf("%d%d",&n,&k);

    dp[][][] = ;

    rep(i,,n) rep(pre,,<<n) rep(now,,<<n) if(ok(pre,now)){

        rep(t,,k-bit(now)+) dp[i+][bit(now)+t][now] += dp[i][t][pre];

    }

    ll ans = ;

    rep(i,,<<n) ans += dp[n][k][i];

    printf("%lld\n",ans);

    return ;

}