#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2020,mod=1e9+7;
int n,cs,cf;
LL f[N][N];
int main()
{
    scanf("%d%d%d",&n,&cs,&cf);
    f[0][0]=1;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<=i;j++)
        {
            if(i+1==cs)
            {
                if(cf<=i)
                {
                    if(j>=2)
                    {
                        f[i+1][j]+=f[i][j]*(j-1)%mod;
                        f[i+1][j]%=mod;
                    }else if(j==1)
                    {
                        f[i+1][j]+=f[i][j]*j%mod;
                        f[i+1][j]%=mod;
                    }
                }else{
                    if(j>=1)
                    {
                        f[i+1][j]+=f[i][j]*j%mod;
                        f[i+1][j]%=mod;
                    }
                }
            }else if(i+1==cf)
            {
                if(cs<=i)
                {
                    if(j>=2)
                    {
                        f[i+1][j]+=f[i][j]*(j-1)%mod;
                        f[i+1][j]%=mod;
                    }else if(j==1)
                    {
                        f[i+1][j]+=f[i][j]*j%mod;
                        f[i+1][j]%=mod;
                    }
                }else{
                    if(j>=1)
                    {
                        f[i+1][j]+=f[i][j]*j%mod;
                        f[i+1][j]%=mod;
                    }
                }
            }else{
                if(i<cs&&i<cf)
                {
                    if(j>=2)
                    {
                        f[i+1][j-1]+=j*(j-1)%mod*f[i][j]%mod;
                        f[i+1][j-1]%=mod;
                    }
                }else if(cs<=i&&cf<=i)
                {
                    if(j>=3)
                    {
                        f[i+1][j-1]+=((j-1)*(j-1)-(j-2)-1)%mod*f[i][j]%mod;
                        f[i+1][j-1]%=mod;
                    }else if(j==2&&i==n-1)
                    {
                        f[i+1][j-1]+=f[i][j]%mod;
                        f[i+1][j-1]%=mod;
                    }
                }else if(cs<=i)
                {
                    if(j>=2)
                    {
                        f[i+1][j-1]+=(j*(j-1)-(j-1))%mod*f[i][j]%mod;
                        f[i+1][j-1]%=mod;
                    }
                }else{
                    if(j>=2)
                    {
                        f[i+1][j-1]+=(j*(j-1)-(j-1))%mod*f[i][j]%mod;
                        f[i+1][j-1]%=mod;
                    }
                }
            }
            f[i+1][j+1]+=f[i][j];
            f[i+1][j+1]%=mod;
        }
    }
    printf("%lld\n",f[n][1]);
    return 0;
}