#include <bits/stdc++.h>
using namespace std;

static auto __fast_io = []()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    return 0;
}();

const long long MOD = 998244353;

long long sum;
long long a[3][3][3];
long long sz;
long long ans;
long long n, m;
long long a1;

void merge()
{
    for (int i = 1; i <= sz; i++)
    {
        for (int j = 1; j <= sz; j++)
        {
            a[2][i][j] = 0;
        }
    }
    for (int k = 1; k <= sz; k++)
    {
        for (int i = 1; i <= sz; i++)
        {
            for (int j = 1; j <= sz; j++)
            {
                a[2][i][j] = (a[2][i][j] + 1ll * a[0][i][k] * a[1][k][j] % MOD) % MOD;
            }
        }
    }
    for (int i = 1; i <= sz; i++)
    {
        for (int j = 1; j <= sz; j++)
        {
            a[0][i][j] = a[2][i][j];
        }
    }
}
void merge2()
{
    for (int i = 1; i <= sz; i++)
    {
        for (int j = 1; j <= sz; j++)
        {
            a[2][i][j] = 0;
        }
    }
    for (int k = 1; k <= sz; k++)
    {
        for (int i = 1; i <= sz; i++)
        {
            for (int j = 1; j <= sz; j++)
            {
                a[2][i][j] = (a[2][i][j] + 1ll * a[1][i][k] * a[1][k][j] % MOD) % MOD;
            }
        }
    }
    for (int i = 1; i <= sz; i++)
    {
        for (int j = 1; j <= sz; j++)
        {
            a[1][i][j] = a[2][i][j];
        }
    }
}
void qpow(long long k)
{
    while (k)
    {
        if (k & 1)
        {
            merge();
        }
        k >>= 1, merge2();
    }
}

void input()
{
    cin >> n >> m >> a1;
}
void work()
{
    ans = a1;
    if (n == 1)
        return;
    sum = a1;
    a1 = (a1 + m) % MOD;
    sum = (sum + a1) % MOD;
    sz = 2;
    ans = a1;
    if (n == 2)
        return;
    a[0][1][1] = a[1][1][1] = 1;
    a[0][1][2] = a[1][1][2] = 1;
    a[0][2][1] = a[1][2][1] = 1;
    a[0][2][2] = a[1][2][2] = 2;
    qpow(n - 3);
    // cout << a[0][1][1] << " " << a[0][1][2] << "\n"
    //      << a[0][2][1] << " " << a[0][2][2] << "\n";
    ans = (a1 * a[0][1][1] % MOD + sum * a[0][2][1] % MOD) % MOD;
}
void output()
{
    cout << ans << "\n";
}

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        input();
        work();
        output();
    }
    return 0;
}