#include<bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define fgx cerr<<"-------------"<<endl
#define N 2000010
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
void dbg(){cerr<<endl;}
template<typename A,typename... B>void dbg(A x,B... y){cerr<<x<<" ";dbg(y...);}
#define debug(...) cerr<<#__VA_ARGS__<<"=",dbg(__VA_ARGS__)
const int mod=1e9+7;
inline int qpow(int x,int y){int A=1;for(;y;y>>=1,x=(ll)x*x%mod)if(y&1)A=(ll)A*x%mod;return A;}
int inv[N],s1[N],s2[N];
inline int gets(int l,int r){return ((s2[r]-s2[l-1]+mod)%mod-ll(r-l+1)*s1[l-1]%mod+mod)%mod;}
inline int getc(int l,int r){return (s1[r]-s1[l-1]+mod)%mod;}
int main()
{    int t; cin>>t;
    for(rint i=1;i<=2000000;i++) inv[i]=qpow(i,mod-2),s1[i]=(s1[i-1]+inv[i])%mod,s2[i]=(s2[i-1]+s1[i])%mod;
    while(t--) {
        int n,x,y,sl=0,sr=0; scanf("%d%d%d",&n,&x,&y);// c[y-1]=c[y+1]=c[y]=0;
    //    for(rint i=y-2;i>=1;i--) c[i]=(c[i+1]+inv[n-i])%mod,(sl+=c[i])%=mod;
    //    for(rint i=y+2;i<=n;i++) c[i]=(c[i-1]+inv[i-1])%mod,(sr+=c[i])%=mod;
        if(x==y){cout<<"0\n";continue;}
        sl=gets(n-y+2,n-1),sr=gets(y+1,n-1);
        if(y==1||y==n)
        {    if(x<y)
                cout<<(getc(n-y+2,n-x)+1)%mod<<"\n";
            else
                cout<<(getc(y+1,x-1)+1)%mod<<"\n";
            continue;
        }
        int k1=ll(n-y)*inv[n-y+1]%mod,b1=((ll)sr*inv[n-y+1]%mod+1)%mod;
        int k2=ll(y-1)*inv[y]%mod,b2=((ll)sl*inv[y]%mod+1)%mod;
        int a=((ll)k1*b2%mod+b1)%mod*qpow((1-(ll)k1*k2%mod+mod)%mod,mod-2)%mod;
        int b=((ll)k2*a%mod+b2)%mod;
        if(x<y)
            cout<<(getc(n-y+2,n-x)+a)%mod<<"\n";
        else
            cout<<(getc(y+1,x-1)+b)%mod<<"\n";
    }
    return 0;
}