#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}


int main(void){
	cin.tie(0);ios::sync_with_stdio(false);
	llint i,n,m,ans=0;cin>>n>>m;
	if(n==1){cout<<1<<endl;return 0;}
	vector<llint>kai(m+1);
	kai[0]=1;
	for(i=1;i<=m;i++){kai[i]=kai[i-1]*i%mod;}
	vector<llint>gya(m+1);
	gya[m]=1;
	llint bgen=kai[m];
	for(int h=0;h<30;h++){
		if((mod-2)&(1<<h)){gya[m]*=bgen;gya[m]%=mod;}
		bgen*=bgen;bgen%=mod;
	}
	for(i=m;i>0;i--){gya[i-1]=gya[i]*i%mod;}
	
	char hou='+';
	int bas=0;
	for(i=0;i<m;i++){
		if(hou=='+'){
			if(bas==0){hou='-';}
			else{bas--;}
		}else{
			if(bas==n-1){hou='+';}
			else{bas++;}
		}
	}
	//スターと地点
	for(i=0;i<=m;i++){
		if(bas==0){ans+=gya[i]*gya[m-i];ans%=mod;}
		if(hou=='-'){
			if(bas==0){hou='+';}
			else{bas--;}
		}else{
			if(bas==n-1){hou='-';}
			else{bas++;}
		}
		if(hou=='-'){
			if(bas==0){hou='+';}
			else{bas--;}
		}else{
			if(bas==n-1){hou='-';}
			else{bas++;}
		}
	}
	ans*=kai[m];ans%=mod;
	cout<<ans<<endl;
	return 0;
}