2411

#include <iostream>#include <algorithm>#include <cstring>using namespace std;int h, w, the[20000], last[20000], index;long long scdp[12][20000];void dfs(int pos, int _the, int _last){if(pos == h){the[index] = _the;last[index] = _last;++index;}else if(pos < h){dfs(pos + 1, (_the << 1) | 1, (_last << 1));dfs(pos + 2, (_the << 2) | 3, (_last << 2) | 3);dfs(pos + 1, (_the << 1), (_last << 1) | 1);}}bool init(){cin >> h >> w;if(h + w){if(w < h){swap(w, h);}index = 0;memset(the, 0, sizeof(the));memset(last, 0, sizeof(last));dfs(0, 0, 0);return true;}return false;}int main(){while(init()){memset(scdp, 0, sizeof(scdp));int final = (1 << h) - 1;scdp[0][final] = 1;for(int i = 1; i <= w; ++i){for(int j = 0; j < index; ++j){scdp[i][the[j]] += scdp[i - 1][last[j]];}}long long ans = 0;ans += scdp[w][final];cout << ans << endl;}return 0;}