131

#include <iostream>#include <algorithm>#include <cstring>using namespace std;size_t M, N, the[100000], last[100000], index;long long scdp[10][512];void dfs(int pos, int s1, int s2, int b1, int b2){if(pos == M){if(!b1 && !b2){the[index] = s1;last[index] = s2;++index;}}else{if(!b1 && !b2){dfs(pos + 1, (s1 << 1) + 1, s2 << 1, 0, 0);dfs(pos + 1, (s1 << 1) + 1, s2 << 1, 1, 0);dfs(pos + 1, (s1 << 1) + 1, s2 << 1, 0, 1);}if(!b1){dfs(pos + 1, (s1 << 1) + 1, (s2 << 1) + 1 - b2, 1, 0);dfs(pos + 1, (s1 << 1) + 1, (s2 << 1) + 1 - b2, 1, 1);}if(!b2){dfs(pos + 1, (s1 << 1) + b1, s2 << 1, 1, 1);}dfs(pos + 1, (s1 << 1) + b1, (s2 << 1) + 1 - b2, 0, 0);}}void init(){cin >> M >> N;if(M + N){if(N < M){swap(N, M);}dfs(0, 0, 0, 0, 0);}}int main(){init();int final = (1 << M) - 1;scdp[0][final] = 1;for(size_t i = 1; i <= N; ++i){for(size_t j = 0; j < index; ++j){scdp[i][the[j]] += scdp[i - 1][last[j]];}}cout << scdp[N][final] << endl;return 0;}