#include<iostream>
#include<cstdio>
#define ll long long
#define mod 1000000007
using namespace std;
int n,m;
ll ans=0,f[3010][3010][2];
int main(){
	scanf("%d%d",&n,&m);
	f[0][0][1]=1;
	for(register int i=1;i<=n;i++)f[0][i][0]=1;
	for(register int i=0;i<m;i++){
		for(register int j=0;j<=n;j++){
			for(register int k=0;k<2;k++){
				if(j){
					f[i+1][j-1][k|(j==1)]=(f[i+1][j-1][k|(j==1)]+f[i][j][k])%mod;
					f[i+1][j][k|(j==1)]=(f[i+1][j][k|(j==1)]+f[i][j][k])%mod;
				}
				if(j<n){
					f[i+1][j+1][k]=(f[i+1][j+1][k]+f[i][j][k])%mod;
					f[i+1][j][k]=(f[i+1][j][k]+f[i][j][k])%mod;
				}
			}

		}
	}
	for(register int i=0;i<=n;i++)ans=(ans+f[m][i][1])%mod;
	printf("%lld",ans);
	return 0;
}