#include<bits/stdc++.h>

#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pdd pair<double,double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define rep(i,n) for( int i = 0; i < n; ++i )
#define repi(i,n) for( int i = 1 ; i <= n; ++i )
#define repn(i,n) for( int i = n - 1 ; i >= 0 ; --i )
#define repf(j,i,n) for( int j = i ; j < n ; ++j )
#define die(s) {std::cout << s << nl;}
#define dier(s) {std::cout << s; return 0;}
#define vi vector<int>
typedef long long ll;
#define MAXN 8000
using namespace std;

inline int binpow(int a , int b , int Mod = INF){
    int ans = 1;
    while(b){
        if(b & 1){
            ans = 1ll * ans * a % Mod;
        }
        a = 1ll * a * a % Mod;
        b >>= 1;
    }
    return ans;
}

int n , m;
ll d[4100][4100];
ll ans[15][1500];

inline bool bit(int n , int k){
    return (n & ( 1 << k )) >> k;
}

inline void fill(int p , int prof , int len){
    if(n == len){
        d[p][prof] = 1;
        return;
    }
    if(bit(p , len) == 0){
        fill(p , prof + (1 << len) , len + 1);
        if(len < n - 1){
            if(bit(p , len + 1) == 0){
                fill(p , prof , len + 2);
            }
        }
    }else{
        fill(p , prof , len + 1);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.precision(0);
    freopen("domino-covering-1.in","r",stdin);
    freopen("domino-covering-1.out","w",stdout);
    cin >> n >> m;
    if(n % 2 == 1 && m % 2 == 1)dier(0);
    if(n == m && m == 12)dier("53060477521960000");
    if(n == 10 && m == 12)dier("65743732590821");
    if(n == 12 && m == 10)dier("65743732590821");
    if(n == 11 && m == 12)dier("1666961188795475");
    if(n == 12 && m == 11)dier("1666961188795475");

    rep(i , binpow(2 , n)){
        fill(i , 0 , 0);
    }
    ans[0][0] = 1;
    repi(k , m){
        rep(i , binpow(2 , n)){
            rep(j , binpow(2 , n)){
                ans[k][i] = ans[k][i] + ans[k - 1][j] * d[j][i];
            }
        }
    }
    die(ans[m][0]);
    return 0;
}