#include <bits/stdc++.h>
using namespace std;
long long dp[15][1005], t[15][1005];
const int MOD = 1e9 + 7;
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= n; ++j) {
      dp[1][j] = 1;
      for (int k = 1; k <= j; ++k)
        dp[i][j] = (dp[i - 1][k] + dp[i][j]) % MOD,
        t[i][j] = (t[i][j - 1] + dp[i][j]) % MOD;
    }
  }
  long long res = 0;
  for (int i = 1; i <= n; ++i) {
    long long rs = t[m][n - i + 1] - t[m][0];
    dp[m][i] = dp[m][i] % MOD * rs % MOD;
    res = (res + dp[m][i]) % MOD;
  }
  cout << res;
  return 0;
}
