#include <bits/stdc++.h>
typedef long long TYPE;
const TYPE mod=1E9+7;
TYPE input() {
    TYPE x;std::cin>>x;
    return x;
}
const TYPE bits=1000000;
const int maxn=32;
struct big {
    TYPE x[maxn];
    big(TYPE y=0) {
        int len=0;
        memset(x,0,sizeof x);
        while(y>0) {
            x[len]=y%bits;
            y/=bits;
            len++;
        }
    }
    TYPE&operator[](const int&i) {
        return x[i];
    }
    const TYPE&operator [](const int&i)const {
        return x[i];
    }
    /*
    void show() {
        for(int i=maxn-1;i>=0;--i) {
            printf("%08lld",x[i]);
        }
    }*/
};
big operator + (const big&a,const big&b) {
    big c;
    for(int i=0;i<maxn;++i) {
        c[i]=a[i]+b[i];
    }
    for(int i=0;i<maxn-1;++i) {
        c[i+1]+=c[i]/bits;
        c[i]%=bits;
    }//c[maxn-1]%=bits;
    return c;
}
big operator *(const big&a,const big&b) {
    big c;
    for(int i=0;i<maxn;++i) {
        for(int j=0;j<maxn;++j) {
            if(i+j<maxn)c[i+j]+=a[i]*b[j];
        }
    }
    for(int i=0;i<maxn-1;++i) {
        c[i+1]+=c[i]/bits;
        c[i]%=bits;
    }//c[maxn-1]%=bits;
    return c;
}
bool operator < (const big&a,const big&b) {
    for(int i=maxn-1;i>=0;--i) {
        if(a[i]!=b[i])return a[i]<b[i];
    }return false;
}
big f[128];
big F(TYPE m,big a,big b) {
    memset(f,0,sizeof f);
    f[0]=b;
    TYPE i=1;
    for(i=1;(1LL<<i)<=m;++i) {
        big n=1LL<<i;
        big n2=1LL<<(i-1LL);
        big n1=(1LL<<i)-1LL;
        f[i]=std::min(a*18LL*n2*n2+7LL*f[i-1],n*n*n*b+n1*n*n*a);
    }return f[i-1];
}
int doing() {
    TYPE m=input();
    TYPE a=input();
    TYPE b=input();
    big g=F(m,a,b);
    TYPE ans=0;
//    g.show();printf("\n");
    for(int i=maxn-1;i>=0;--i) {
        ans=(ans*bits%mod+g[i])%mod;
    }
    std::cout<<ans<<std::endl;
    return 0;
}
int main() {
//    printf(big(5)<big(bits+4) ? "YES":"NO");
    int t=input();
    while(t-->0) doing();
    return 0;
}