#include<stdio.h>
#include<cctype>
#include<algorithm>
using namespace std;
#define Maxn 3009
int read() {
	int x=0;char ch=getchar();
	while(!isdigit(ch)) ch=getchar();
	while(isdigit(ch)) {
		x=x*10+ch-48;
		ch=getchar();
	}
	return x;
}
int n,m,p,ans,f[Maxn][Maxn][2];
int main(){
	n=read();m=read();p=(int)(1e9+7);
	f[0][0][1]=1;
	for(int i=1;i<=n;++i) f[0][i][0]=1;
	for(int i=0;i<m;++i)
		for(int j=0;j<=n;++j)
			for(int k=0;k<=1;++k) {
				if(j) {
					(f[i+1][j-1][k|(j==1)]+=f[i][j][k])%=p;
					(f[i+1][j][k|(j==1)]+=f[i][j][k])%=p;
				}
				if(n-j) {
					(f[i+1][j][k]+=f[i][j][k])%=p;
					(f[i+1][j+1][k]+=f[i][j][k])%=p;
				}
			}
	int ans=0;
	for(int i=0;i<=n;++i) 
		(ans+=f[m][i][1])%=p;
	printf("%d\n",ans);
	return 0;
}