#include<bits/stdc++.h>
using namespace std;
#define INF 2e18
#define int long long
const int N=1e6+10,mod=998244353;
int x,y,p0,p1,t;
struct Sg{
	int a,b;
};
int qmi(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res%mod;
}
int gcd(int a,int b)
{
    if(!b) return a;
    return gcd(b,a%b);
}
Sg dfs(int a,int b)
{
	Sg res;
	if(a==b)
	{
		res={p0,t};
		return res;
	}
	int k=(a-1)/b;
	int cnt1=(p0*(qmi(t,k)-qmi(p1,k))+mod)%mod;
	int cnt2=qmi(t,k)*(t-p1)%mod;
	int g=gcd(cnt1,cnt2);
	cnt1/=g,cnt2/=g;
	res={cnt1,cnt2};
	int t1=qmi(p1,(a-1)/b),t2=qmi(t,(a-1)/b);
	a-=(a-1)/b*b;
	int t3=qmi(p0,(b-1)/b),t4=qmi(t,(b-1)/a);
	b-=(b-1)/a*a;
	t1=t1*t3%mod,t2=t2*t4%mod;
	g=gcd(t1,t2);
	t1/=g,t2/=g;
	int a1=dfs(a,b).a,b1=dfs(a,b).b;
	t1=t1*a1%mod,t2=t2*b1%mod;
	g=gcd(t1,t2);
	t1/=g,t2/=g;
	res={(t2*cnt1+t1*cnt2)%mod,cnt2*t2%mod};
	g=gcd(res.a,res.b);
	res.a/=g,res.b/=g;
	return res;
}
void solve()
{
	cin>>x>>y>>p0>>p1>>t;
	t=p0+p1;
	Sg ans={qmi(p0,(y-1)/x),qmi(t,(y-1)/x)};
	y-=(y-1)/x*x;
	ans.a=ans.a*dfs(x,y).a%mod;
	ans.b=ans.b*dfs(x,y).b%mod;
	int g=gcd(ans.a,ans.b);
	ans.a/=g,ans.b/=g;
	cout<<(ans.a*qmi(ans.b,mod-2)+mod)%mod<<endl;
}
signed main()
{
	ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int _;
    cin>>_;
    while(_--) solve();
}