#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long M=998244353;
ll ksm(ll a, ll b){
    ll res = 1;
    while(b) {
        if(b & 1) //判断b的二进制在此位是否为1
            res = res * a % M;
        a = a * a % M; //下一位的a的值
        b >>= 1;
    }
    return res;
}
long long mod(long long a,long long b){
	return a * ksm(b, M - 2) % M;
}
int main() {
    int all;
    cin>>all;
    while(all--){
    	ll x,y,a,b,c;
    	cin>>x>>y;
    	cin>>a>>b>>c;
    	c=a+b;
    	//fenshu sum={1,1};
    	long long SUM=1;
    	while(y!=0&&x!=0){
    		if(x>y){
    			ll k1=ksm(c,x/y);
    			ll k2=ksm(b,x/y);
    			SUM*=mod((k1-k2 + M) % M ,k1);
    			SUM%=M;
    			x-=x/y*y;
    			continue;
			}
//			cout<<sum.son<<' '<<sum.mon<<endl;
			if(y==0||x==0) break;
			if(x<y){
				ll k1=ksm(c,y/x);
    			ll k2=ksm(a,y/x);
				//sum=cheng(sum,{k2,k1});
				SUM*=mod(k2,k1);
				SUM%=M;
				y-=y/x*x;
				continue;
			}
			if(y==0||x==0) break;
			if(x==y){
				//sum=cheng(sum,{a,c});
				SUM*=mod(a,c);
				SUM%=M;
				break;
			}
		}
//		cout<<a<<' '<<c<<endl;
//		cout<<sum.son<<' '<<sum.mon<<endl;
		cout<<SUM<<endl;
	}
    return 0;
}