// poj2411#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>#define LL long long#define HAS 4001#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxs=100010;LL f[2][maxs];int n,m,bin[30];int main() {	bin[0]=1;for (int i=1;i<=20;i++) bin[i]=bin[i-1]<<1;	while (scanf("%d%d",&n,&m)!=EOF && n && m) {		memset(f,0,sizeof(f));		int p=0;f[0][0]=1;		for (int i=0;i<n;i++)			for (int j=0;j<m;j++) {				p^=1;memset(f[p],0,sizeof(f[p]));				for (int st=0;st<bin[m];st++) if (f[p^1][st]) {						int left=j ? st>>(j-1)&1 : 0,up=st>>j&1;						if (up) f[p][st^bin[j]]+=f[p^1][st];						else {							if (left) f[p][st^bin[j-1]]+=f[p^1][st];							f[p][st^bin[j]]+=f[p^1][st];						}					}			}		printf("%lld\n",f[p][0]);	}    return 0;}