#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"YES"<<"\n"; else cout<<"NO"<<"\n";}

vector<vector<ll>> v_mul(vector<vector<ll>> a,vector<vector<ll>> b){
  int A=a.size(),B=a[0].size(),C=b.size(),D=b[0].size();
  vector<vector<ll>> r(A,vector<ll>(D));
  for(int i=0;i<A;i++){
    for(int k=0;k<B;k++){
      for(int j=0;j<D;j++){
        r[i][j]+=(a[i][k]*b[k][j])%Q;
		r[i][j]%=Q;
      }
    }
  }
  return r;
}
vector<vector<ll>> v_jyo(vector<vector<ll>> a,int64_t N){
  int m=a.size();
  ll H=1;
  vector<vector<ll>> r(m,vector<ll>(m,0));
  for(int i=0;i<m;i++){
    r[i][i]=1;
  }
  while(N>0){
    H*=2;
    if(N%H){
      N-=(H/2);
      r=v_mul(r,a);
    }
    a=v_mul(a,a);
  }
  return r;
}

ll jyo(ll a,ll b){
	if(b==0) return 1;
	if(b%2==0) return jyo((a*a)%Q,b/2);
	return (a*jyo(a,b-1))%Q;
}

//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll ma,na,s,mb,nb,t,k;
	cin>>ma>>na>>s>>mb>>nb>>t>>k;
	ll A=(ma*jyo(na,Q-2))%Q;
	ll B=(mb*jyo(nb,Q-2))%Q;
	int N=s+t+1;
	//cout<<A<<" "<<B<<endl;
	vector<vector<ll>> p(N,vector<ll>(N));
	p[0][0]=1;
	p[N-1][N-1]=1;
	auto q=p;
	rep(i,N-1){
		if(i==0) continue;
		p[i][i]=(Q+1-A)%Q;
		for(int j=i+1;j<N-1;j++){
			p[j][i]=(p[j-1][i]*A)%Q;
		}
		p[N-1][i]=jyo(A,N-1-i);
		q[i][i]=(Q+1-B)%Q;
		for(int j=i-1;j>0;j--){
			q[j][i]=(q[j+1][i]*B)%Q;
		}
		q[0][i]=jyo(B,i);
	}
	p=v_mul(q,p);
	/*rep(i,N){
		rep(j,N) cout<<p[i][j]<<" ";
		cout<<endl;
	}*/
	vector<vector<ll>> ans(N,vector<ll>(1));
	ans[t][0]=1;
	ans=v_mul(v_jyo(p,k),ans);
	cout<<ans[N-1][0]<<"\n"<<ans[0][0]<<"\n";
}