#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
using namespace std;

const int mo=1000000007;
const int N=2000005;
int inv[N],Sinv[N],SSinv[N];
void init(){
    inv[0]=inv[1]=1;
    for (int i=2;i<N;i++) inv[i]=1ll*inv[mo%i]*(mo-mo/i)%mo;
    for (int i=1;i<N;i++) Sinv[i]=(Sinv[i-1]+inv[i])%mo;
    for (int i=1;i<N;i++) SSinv[i]=(SSinv[i-1]+Sinv[i])%mo;
}
void solve(){
    int n,x,y;
    scanf("%d%d%d",&n,&x,&y);
    int S=0,C=1,l1;
    l1=y-1; S=(S+l1+mo-1ll*l1*Sinv[n]%mo+(SSinv[n-1]+mo-SSinv[n-l1-1]))%mo;
    l1=n-y; S=(S+l1+mo-1ll*l1*Sinv[n]%mo+(SSinv[n-1]+mo-SSinv[n-l1-1]))%mo;
    if (x<y){
        l1=x; C=(Sinv[n]+mo-Sinv[n-l1])%mo;
        printf("%d\n",(S+1+mo-C)%mo);
    }
    else if (x==y){
        puts("0");
    }
    else{
        l1=n-x+1; C=(Sinv[n]+mo-Sinv[n-l1])%mo;
        printf("%d\n",(S+1+mo-C)%mo);
    }
}
int main(){
    init();
    int T;
    scanf("%d",&T);
    while (T--) solve();
}