#include<algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include  <stdio.h>
#include   <math.h>
#include   <time.h>
#include   <vector>
#include   <bitset>
#include    <queue>
#include      <map>
#include      <set>
using namespace std;

typedef long long LL;
const int Mod=1e9+7;
__int128 Ans;
LL n,a,b;

__int128 dfs(LL n)
{
    if(n%2==1)
        return b*n*n*n+a*(n-1)*n*n;
    return min((__int128)b*n*n*n+(__int128)a*(n-1)*n*n,(__int128)18*(n/2)*(n/2)*a+7*dfs(n/2));
}

void solve()
{
    cin>>n>>a>>b;
    cout<<int(dfs(n)%Mod)<<endl;
}

int main()
{
    int t;cin>>t;
    while(t--)
        solve(); 
    return 0;
}