#include <bits/stdc++.h>
using namespace std;
long long const N = 1e3;
long long INF = 0x3f3f3f3f;
long long t, n, m, dp1[15][1050], dp2[15][1050];
long long const mod = 1e9 + 7;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      if (j == 1)
        dp1[i][j] = 1;
      else
        dp1[i][j] = dp1[i - 1][j] + dp1[i][j - 1];
      dp1[i][j] %= mod;
    }
  }
  for (int i = 1; i <= m; i++) {
    for (int j = n; j >= 1; j--) {
      if (j == n)
        dp2[i][j] = 1;
      else
        dp2[i][j] = dp2[i - 1][j] + dp2[i][j + 1];
      dp2[i][j] %= mod;
    }
  }
  for (int i = n - 1; i >= 1; i--) {
    dp2[m][i] += dp2[m][i + 1];
    dp2[m][i] %= mod;
  }
  long long ans = 0;
  long long ps1 = 0, ps2 = 0;
  for (int i = 1; i <= n; i++) {
    ans += (dp1[m][i] * dp2[m][i]);
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}
