#include <bits/stdc++.h>

const int MAXN = 3010;
const int mod = 1000000007;
void reduce(int & x) { x += x >> 31 & mod; }
int f[2][MAXN][2], n, m;
int main() {
	std::ios_base::sync_with_stdio(false), std::cin.tie(0);
	std::cin >> n >> m;
	int ans = 0, now = 1, lst = 0;
	for (int i = 0; i <= n; ++i) f[now][i][i == 0] = 1;
	for (int i = 0; i < m * 2; ++i) {
		std::swap(now, lst);
		memset(f[now], 0, sizeof f[now]);
		int ax = i % 2 == 0, up = n + (!ax);
		for (int j = 0; j <= up; ++j) 
		for (int k = 0; k != 2; ++k) if (int t = f[lst][j][k]) {
			if (j)
			reduce(f[now][j - 1 + ax][k | (j == 1)] += t - mod);
			if (j < up)
			reduce(f[now][j + ax][k] += t - mod);
		}
	}
	for (int i = 0; i <= n; ++i) reduce(ans += f[now][i][1] - mod);
	std::cout << ans << std::endl;
	return 0;
}
