#include<cstdio>
#include<cstring>
using namespace std;
#define MOD 1000000007
int f[2][(1<<5)+10],n,m;
int main(){
	scanf("%d%d",&n,&m);
	int cur=0;
	f[0][(1<<m)-1]=1;
	for(int i=0;i<n;++i){
		for(int j=0;j<m;++j){
			cur^=1;
			memset(f[cur],0,sizeof(f[cur]));
			for(int k=0;k<(1<<m);++k){
				if(k&(1<<(m-1))){
					f[cur][(k<<1)^(1<<m)]=(f[cur][(k<<1)^(1<<m)]+f[cur^1][k])%MOD;
				}
				if(i && !(k&(1<<(m-1)))){
					f[cur][k<<1|1]=(f[cur][k<<1|1]+f[cur^1][k])%MOD;
				}
				if(j && !(k&1) && (k&(1<<(m-1)))){
					f[cur][(k<<1)^(1<<m)|3]=(f[cur][(k<<1)^(1<<m)|3]+f[cur^1][k])%MOD;
				}
			}
		}
	}
	printf("%d\n",f[cur][(1<<m)-1]);
	return 0;
}