#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 3005;
const int MOD = 1e9 + 7;
int m, n;
int dp[MAXN][MAXN];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> m >> n;
for (int i = 0; i <= m; i++)
{
dp[i][0] = 1;
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
dp[i][j] = dp[i - 1][j];
dp[i][j] += dp[i - 1][j - 1] * 4 * (n - j + 1);
dp[i][j] %= MOD;
if (i >= 2)
{
dp[i][j] += dp[i - 2][j - 1] * (n - j + 1) * (i - 1);
dp[i][j] %= MOD;
}
if (j >= 2)
{
dp[i][j] += dp[i - 1][j - 2] * (n - j + 1) * (n - j + 2) / 2;
dp[i][j] %= MOD;
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
{
ans += dp[m][i];
ans %= MOD;
}
cout << ans;
}
