http://acm.hdu.edu.cn/showproblem.php?pid=6719
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=2e5+9;
const int maxm=4e5+9;
const int mod=1e9+7;
ll n;
ll a,b;
__int128 dfs(__int128 n)
{
if(n&1)
{
return (n*n*n*b+(n-1)*n*n*a);
}
else
{
__int128 num=dfs(n/2);
//cout<<num<<endl;
return min((n*n*n*b+(n-1)*n*n*a),(18*(n/2)*(n/2)*a+7*num));
}
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int T;
//sfi(T);
cin>>T;
while(T--)
{
cin>>n>>a>>b;
cout<<((ll)(dfs(n)%mod))<<endl;
}
return 0;
}