#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)s; i < (int)e; ++i)
#define all(a) (a).begin(), (a).end()

const ll mod = 1e9 + 7;

ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}

ll modinv(ll a, ll m) {
    return modpow(a, m - 2, m);
}

int main() {
    cin.tie(nullptr);
    
    ll N, M;
    cin >> N >> M;
    
    ll ans = 1;
    rep(i, 0, N + 1) {
        ans *= M + 1 - i;
        ans %= mod;
    }
    rep(i, 1, N + 2) {
        ans *= modinv(i, mod);
        ans %= mod;
    }
    
    cout << ans << '\n';
}