#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int gcdExtended(int a, int b, int* x, int* y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long modInverse(long long a, long long m) {
  int x, y;
  int g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    return 0;
  else {
    long long res = (x % m + m) % m;
    return res;
  }
}
long long nCr(int n, int r) {
  if (r > n) {
    return 0;
  }
  if (r > n - r) {
    r = n - r;
  }
  long long ans = 1;
  for (int i = 1; i <= r; i++) {
    ans *= (n - i + 1);
    ans %= mod;
    ans *= modInverse(i, mod);
    ans %= mod;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  long long ans = 0;
  ans = nCr(n + 2 * m - 1, 2 * m);
  ans %= mod;
  cout << ans;
}
