// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 1100

int n, m;
int dp[MAXN][MAXN];

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    cin >> n >> m;
    // dp[0][(1<<n) - 1] = 1;
    dp[0][0] = 1;
    dp[0][1+2] = 1;
    dp[0][2+4] = 1;
    dp[0][4+8] = 1;
    dp[0][1+2+4+8] = 1;
    rep(i, 0, m-1) {
        rep(j, 0, (1<<n)) {
            dp[i+1][j ^ (((1<<n) - 1))] += dp[i][j];
        }
    }
    rep(i, 0, 1<<n) {
        debug(i, dp[1][i])
    }
    cout << dp[m-1][(1<<n) - 1] << endl;

    return 0;
}