#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7, dp[100005];
int main() {
  int n, m;
  cin >> n >> m;
  dp[0] = 1;
  for (int i = 1; i <= n + m - 1; i++) {
    for (int j = min(i, m); j > 0; j--)
      dp[j] = (dp[j] % mod + dp[j - 1] % mod) % mod;
  }
  cout << (2 * dp[m]) % mod << endl;
  return 0;
}
