#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define endl "\n"
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4500000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
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 (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
using mint = modint998244353;
//s-1 s-2 ... 0 ... -t+2 -t+1 ans_1 ans_2
vector<vector<mint>> multi(vector<vector<mint>> &a,vector<vector<mint>> &b){
  vector<vector<mint>> c(a.size(),vector<mint>(b[0].size()));
  for(int i=0;i<int(a.size());i++){
    for(int k=0;k<int(b.size());k++){
      for(int j=0;j<int(b[0].size());j++){
        c[i][j]=(c[i][j] + (a[i][k] * b[k][j]));
      }
    }
  }
  return c;
}
vector<vector<mint>> mul_exp(vector<vector<mint>> adj, ll k){
  if (k == 1) return adj;
  vector<vector<mint>> res(int(adj.size()),vector<mint>(int(adj[0].size())));
  for(int i=0;i<int(adj.size());i++){
    res[i][i]=1;
  }
  while(k>0){
    if(k&1) res=multi(adj,res);
    adj=multi(adj,adj);
    k/=2;
  }
  return res;
}
int main() {
  cincout();
  ll ma,na,s;
  cin>>ma>>na>>s;
  ll mb,nb,t;
  cin>>mb>>nb>>t;
  ll k;
  cin>>k;
  ll win1,win2;
  win1=s+t-1;
  win2=s+t;
  vector<vector<mint>> dp(s+t+1,vector<mint>(s+t+1));
  vector<vector<mint>> dp2(s+t+1,vector<mint>(s+t+1));
  for(int i=0;i<s+t-1;i++){
    for(int j=i;j<s+t-1;j++){
      //cout<<i<<" "<<j<<endl;
      dp[i][j]=(mint(mb)/mint(nb)).pow(j-i)*mint(nb-mb)/mint(nb);
    }
    dp[i][win2]=(mint(mb)/mint(nb)).pow(s+t-1-i);
  }
  for(int i=0;i<s+t-1;i++){
    for(int j=i;j>=0;j--){
      dp2[i][j]=(mint(ma)/mint(na)).pow(i-j)*mint(na-ma)/mint(na);
    }
    dp2[i][win1]=(mint(ma)/mint(na)).pow(i+1);
  }
  dp2[win2][win2]=1;
  dp2[win1][win1]=1;
  dp[win1][win1]=1;
  dp[win2][win2]=1;
  /*for(int i=0;i<s+t+1;i++){
    for(int j=0;j<s+t+1;j++){
      cout<<dp[i][j].val()<<" ";
    }
    cout<<endl;
  }
  cout<<endl;
  for(int i=0;i<s+t+1;i++){
    for(int j=0;j<s+t+1;j++){
      cout<<dp2[i][j].val()<<" ";
    }
    cout<<endl;
  }
  cout<<endl;*/
  dp=multi(dp2,dp);
  dp=mul_exp(dp,k);
/*  for(int i=0;i<s+t+1;i++){
    for(int j=0;j<s+t+1;j++){
      cout<<dp[i][j].val()<<" ";
    }
    cout<<endl;
  }
  cout<<endl;*/
  cout<<dp[s-1][win1].val()<<endl;
  cout<<dp[s-1][win2].val()<<endl;
}