#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
#define __ %=Mod
using namespace std;

const ll Mod = 1e9+7;
const int maxn = 4100;

int n,m;
ll f[2][maxn];
ll solve(const int u)
{
	int now=0; memset(f,0,sizeof f);
	for(int i=0;i<=u;i++) f[now][i]=1ll;
	for(int i=1;i<=m;i++)
	{
		now=!now;
		for(int j=0;j<=u;j++)
		{
			f[now][j]=f[!now][j]*2ll%Mod;
			if(j) (f[now][j]+=f[!now][j-1])__;
			if(j<u) (f[now][j]+=f[!now][j+1])__;
		}
	}
	ll re=0;
	for(int i=0;i<=u;i++) (re+=f[now][i])__;
	return re;
}

int main()
{
	scanf("%d%d",&n,&m); n--; m--;
	ll ans1=solve(n);
	ll ans2=n?solve(n-1):0;
	ans1=(ans1-ans2+Mod)%Mod;
	printf("%lld\n",ans1*4ll%Mod);
	
	return 0;
}
