#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

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

const int MOD=998244353;

vector<vector<ll>> matrixmul(ll m,vector<vector<ll>> a,vector<vector<ll>> b){
  vector<vector<ll>> c(m,vector<ll>(m,0));
  rep(i,m){
    rep(j,m){
      rep(k,m) c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
    }
  }
  return c;
}

vector<vector<ll>> matrixpow(ll m,vector<vector<ll>> vec,ll n){
  vector<vector<ll>> ans(m,vector<ll>(m,0));
  rep(i,m) ans[i][i]=1;
  while(n){
    if(n&1) ans=matrixmul(m,ans,vec);
    vec=matrixmul(m,vec,vec);
    n>>=1;
  }
  return ans;
}

ll modinv(ll a,ll m){
  ll b=m,u=1,v=0;
  while(b){
    ll t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  u%=m; 
  if(u<0) u+=m;
  return u;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll ma,na,s,mb,nb,t,k;
  cin>>ma>>na>>s>>mb>>nb>>t>>k;
  
  ll pa=ma*modinv(na,MOD)%MOD;
  ll qa=(1LL-pa+MOD)%MOD;
  ll pb=mb*modinv(nb,MOD)%MOD;
  ll qb=(1LL-pb+MOD)%MOD;
  
  
  ll n=s+t+1;
  vector<vector<ll>> A(n,vector<ll> (n)),B(n,vector<ll> (n));
  A[0][0]=1,B[0][0]=1,A[n-1][n-1]=1,B[n-1][n-1]=1;
  
  for(int j=1;j<=n-2;j++) A[0][j]=A[0][j-1]*pa%MOD;
  for(int i=1;i<=n-2;i++){
    for(int j=i;j<=n-2;j++){
      if(j==i) A[i][j]=qa;
      else A[i][j]=A[i][j-1]*pa%MOD;
    }
  }
  
  for(int j=n-2;j>=1;j--) B[n-1][j]=B[n-1][j+1]*pb%MOD;
  for(int i=1;i<=n-2;i++){
    for(int j=i;j>=1;j--){
      if(j==i) B[i][j]=qb;
      else B[i][j]=B[i][j+1]*pb%MOD;
    }
  }
  vector<vector<ll>> C=matrixmul(n,B,A);
  vector<vector<ll>> D=matrixpow(n,C,k);
  
  cout<<D[0][s]<<endl;
  cout<<D[n-1][s]<<endl;

  return 0;
}