#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

struct Matrix{
	long long val[2][2];
};

int T;
long long n, k, temp;
long long mod = 998244353;

Matrix mul(Matrix &a, Matrix &b){
	Matrix res;
	int n = 2, m = 2, p = 2;
	for(int i = 0; i < n; i ++){
		for (int j = 0; j < m; j ++){
			res.val[i][j] = 0;
			for (int k = 0; k < p; k ++){
				res.val[i][j] += 1LL * a.val[i][k] * b.val[k][j];
				res.val[i][j] %= mod;
			}
		}
	}
	return res;
}

Matrix qpow(Matrix a, long long b){
	Matrix res;
	int n = 2;
	for (int i = 0; i < n; i ++){
		for (int j = 0; j < n; j ++){
			if (i == j) res.val[i][j] = 1;
			else res.val[i][j] = 0;
		}
	}
	while (b){
		if (b & 1){
			res = mul(res, a);
		}
		b >>= 1;
		a = mul(a, a);
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("../data.in","r",stdin);
    freopen("../data.out","w",stdout);
#endif

	scanf("%d", &T);
	while (T --){
		scanf("%lld %lld %lld", &n, &k, &temp);
		if (n == 1){
			printf("%lld\n", temp);
			continue;
		}else if (n == 2){
			printf("%lld\n", temp + k);
			continue;
		}
		Matrix cur;
		cur.val[0][0] = cur.val[0][1] = cur.val[1][0] = 1;
		cur.val[1][1] = 2;
		cur = qpow(cur, n - 2);
		printf("%lld\n", (cur.val[0][0] * (temp + k) + cur.val[0][1] * (temp + temp + k)) % mod);
	}

    return 0;
}