#include <bits/stdc++.h>
using namespace std;
int n, m;
long long dp[22][1010];
long long f(int pos, int prv) {
  if (pos == m * 2) return 1;
  long long &ret = dp[pos][prv];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = prv; i <= n; i++) {
    ret = (ret + f(pos + 1, i)) % 1000000007;
  }
  return ret;
}
int main() {
  cin >> n >> m;
  memset(dp, -1, sizeof dp);
  cout << f(0, 1) << endl;
  return 0;
}
