//#include <bits/stdc++.h>
#pragma GCC optimize(3)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstring>
#include<bitset>
//#include <random>

#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define mset(var,val) memset(var,val,sizeof(var))
#define IOS ios::sync_with_stdio(false);cin.tie(0)

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)

using namespace std;
typedef long long ll;

#ifdef local
#define dbg(args...) do { cout << "\033[32;1m" << #args << " -> "; err(args); } while (0)
void err() {
    cout << "\033[39;0m" << endl;
}
template<template<typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
    for (auto x: a)
        cout << x << ' ';
    err(args...);
}
template<typename T, typename... Args>
void err(T a, Args... args) {
    cout << a << ' ';
    err(args...);
}
#else
#define dbg(...)
#endif



template<class T>
inline bool scan(T&ret) {
    char c;
    int sgn;
    if(c=getchar(),c==EOF)
        return 0;
    while(c!='-' and (c<'0' or c>'9'))
        c=getchar();
    sgn=(c=='-')?-1:1;
    ret=(c=='-')?0:(c-'0');
    while(c=getchar(),c>='0' and c<='9')
        ret=ret*10+(c-'0');
    ret*=sgn;
    return 1;
}

template<class T>
inline void out(T x) {
    if(x>9)
        out(x/10);
    putchar(x%10+'0');
}


int _ = 0;
void testcase() {
    cout << "Case " << (++_) << ": ";
}

const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-6;
const int mod = 1e9+7;
//const int maxn = 3e6;
const int N = (1<<20)+5;
const int M = 710;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


#define lson rt<<1
#define rson rt<<1|1

using LL = __int128;

map<ll,LL> mp;
ll a,b;
LL cal(ll n){
    if(mp.count(n)){
        return mp[n];
    }
    LL ans = (LL)n*n*n*b + (LL)n*n*(n-1)*a;
    if(!(n&1)){
        ans = min(ans, (LL)18*(n/2)*(n/2)*a + 7*cal(n/2));
    }
    mp[n] = ans;
    return ans;
}

void work() {
    ll n;
    cin >> n >> a >> b;
    mp.clear();
    LL ans = cal(n);
    ll res = ans%mod;
    cout <<res << "\n";
}


int main() {
#ifdef local
    freopen("../in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
#endif // local
    IOS;
    int t;
    cin >> t;
    for(;t--;)
        work();
    return 0;
}