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

typedef long long LL ;
const int N = 1e5+10 ;
#define mod 998244353
inline LL qpow(LL a,LL b)
{
	LL res=1;
	while(b)
	{
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
int x , y , a0 , a1 , b ;
LL p1 , p2 ;
LL calc( LL x , LL y )
{
	if( x == 0 ) return 0 ;
	if( y == 0 ) return 1 ;
	LL res=0 ;
	if( x >= y ) {
		int tim = x/y ;
		res=(res+calc(x%y,y)*qpow(p2,tim)%mod+1-qpow(p2,tim)+mod)%mod;	
	}
	else if( x < y ) res+=calc(x,y%x)*qpow(p1,y/x)%mod ;
	return res;
}
void solve()
{
	scanf("%d%d%d%d%d" , &x , &y , &a0 , &a1 , &b ) ;
	p1 = (a0+(b-a0-a1)*a0%mod*qpow(a0+a1,mod-2))%mod*qpow(b,mod-2)%mod ;
	p2 = (1-p1+mod)%mod ;
//	printf("%lld %lld\n" , p1 , p2 ) ;
	printf("%lld\n" , calc(x,y) ) ;
}

int main()
{
	int t ;
	scanf("%d" , &t ) ;
	while( t -- ) solve() ;
	return 0 ;
}