#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int arr[1200][22];
int ncr(int n, int r) {
  if (r == 1) {
    return n;
  }
  if (n == r) {
    return 1;
  }
  if (arr[n][r] == 0) {
    arr[n][r] = 1LL * (ncr(n - 1, r) % mod + ncr(n - 1, r - 1) % mod) % mod;
  }
  return arr[n][r];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  cout << ncr(2 * m + n - 1, 2 * m) << endl;
  return 0;
}
