#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1000 + 10;
const long long maxm = 10 + 10;
const long long Mod = 1e9 + 7;
long long n, m, dp1[maxm][maxn], dp2[maxm][maxn], sigma[maxn];
int main() {
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) dp1[1][i] = dp2[1][i] = 1;
  for (long long i = 1; i <= m; i++) {
    for (long long j = 1; j <= n; j++) {
      for (long long k = 1; k <= j; k++) {
        dp1[i][j] = (dp1[i][j] + dp1[i - 1][k]) % Mod;
        ;
      }
    }
    for (long long j = 1; j <= n; j++) {
      for (long long k = j; k <= n; k++) {
        dp2[i][j] = (dp2[i][j] + dp2[i - 1][k]) % Mod;
      }
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    for (long long j = i; j <= n; j++) {
      ans = (ans + dp1[m][i] * dp2[m][j] % Mod) % Mod;
    }
  }
  cout << ans << endl;
  return 0;
}
