#include <bits/stdc++.h>
using namespace std;
const long long N = 1e4 + 5;
const long long INF = 1e18L;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}
inline long long add(long long x, long long y, long long mod) {
  if (x >= mod) x %= mod;
  if (y >= mod) y %= mod;
  x += y;
  return (x >= mod ? x - mod : x);
}
inline long long mul(long long x, long long y, long long mod) {
  if (x >= mod) x %= mod;
  if (y >= mod) y %= mod;
  return (x * y) % mod;
}
inline long long sub(long long x, long long y, long long mod) {
  x -= y;
  if (x + mod <= 0) {
    x %= mod;
  }
  return (x < 0 ? x + mod : x);
}
long long PowerMod(long long x, long long n, long long mod) {
  long long res = 1;
  for (; n > 0;) {
    if (n & 1) {
      res = mul(res, x, mod);
    }
    x = mul(x, x, mod);
    n /= 2;
  }
  return res;
}
long long ar[N];
long long fac[N];
long long inv[N];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long mod = 1000000007;
  inv[1] = 1;
  fac[0] = 1;
  for (long long i = 1; i <= N; i++) {
    fac[i] = mul(fac[i - 1], i, mod);
    inv[i] = PowerMod(fac[i], mod - 2, mod);
  }
  long long T = 1;
  while (T--) {
    long long n, m;
    cin >> n >> m;
    if (n == 1) {
      return cout << 1, 0;
    }
    cout << mul(mul(fac[n + 2 * m - 1], inv[n - 1], mod), inv[2 * m], mod)
         << endl;
  }
  cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
  return 0;
}
