#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

const ll mo=998244353;
ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

ll MA,MB,NA,NB;
int S,T,K;

const int MAT=101;
struct Mat { ll v[MAT][MAT]; Mat(){ZERO(v);};};

Mat mulmat(Mat& a,Mat& b,int n=MAT) {
	ll mo2=4*mo*mo;
	int x,y,z; Mat r;
	FOR(x,n) FOR(y,n) r.v[x][y]=0;
	FOR(x,n) FOR(z,n) FOR(y,n) {
		r.v[x][y] += a.v[x][z]*b.v[z][y];
		if(r.v[x][y]>mo2) r.v[x][y] -= mo2;
	}
	FOR(x,n) FOR(y,n) r.v[x][y]%=mo;
	return r;
}

Mat powmat(ll p,Mat a,int n=MAT) {
	int i,x,y; Mat r;
	FOR(x,n) FOR(y,n) r.v[x][y]=0;
	FOR(i,n) r.v[i][i]=1;
	while(p) {
		if(p%2) r=mulmat(r,a,n);
		a=mulmat(a,a,n);
		p>>=1;
	}
	return r;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>MA>>NA>>S;
	cin>>MB>>NB>>T;
	MA=MA*modpow(NA)%mo;
	MB=MB*modpow(NB)%mo;
	
	cin>>K;
	Mat A,B;
	A.v[50+S][50+S]=B.v[50+S][50+S]=1;
	A.v[50-T][50-T]=B.v[50-T][50-T]=1;
	for(x=50-T+1;x<50+S;x++) {
		ll pat=1;
		for(y=x;y<50+S;y++) {
			A.v[y][x]=pat*(1+mo-MA)%mo;
			pat=pat*MA%mo;
		}
		A.v[50+S][x]=pat;
		pat=1;
		for(y=x;y>50-T;y--) {
			B.v[y][x]=pat*(1+mo-MB)%mo;
			pat=pat*MB%mo;
		}
		B.v[50-T][x]=pat;
	}
	
	Mat C=mulmat(B,A);
	C=powmat(K,C);
	
	cout<<C.v[50+S][50]<<endl;
	cout<<C.v[50-T][50]<<endl;
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}