#include <bits/stdc++.h>
/*
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <cstring>
#include <algorithm>
#include <cstdio>
*/
using namespace std;
#define Riep(n) for(int i=1;i<=n;i++)
#define Riop(n) for(int i=0;i<n;i++)
#define Rjep(n) for(int j=1;j<=n;j++)
#define Rjop(n) for(int j=0;j<n;j++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
typedef long long LL;
const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=0x3f3f3f3f;
const int N=2e5+25;
int n,m;
LL dp[2*N];
int Init()
{
    dp[1]=1;
    for(int i=2;i<2*N;i++)
    {
        dp[i]=dp[i-1]*(LL)i;
        dp[i]%=mod;
    }
}
LL fastpow(LL x,LL y)
{
    LL ans=1,base=x;
    while(y)
    {
        if(y&1)
        {
            ans*=base;
            ans%=mod;
        }
        base*=base;
        base%=mod;
        y>>=1;
    }
    return ans;
}
int main()
{
        Init();
       while(scanf("%d%d",&n,&m)!=EOF)
       {
           if(n==2||m==2)cout<<"1"<<"\n";
           else
           {
           n-=2;
           m-=2;
           LL x=dp[n],y=dp[m];
           LL ans=dp[n+m]*fastpow(x*y%mod,mod-2)%mod;
           cout<<ans<<"\n";
           }
       }


    return 0;
}