#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
// constexpr ll mod=1000000007;
constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
}

#include<atcoder/all>
using namespace atcoder;
using mint=modint998244353;

vector<vector<mint>> prod(vector<vector<mint>>& a,vector<vector<mint>>& b){
  vector<vector<mint>> res(a.size(),vector<mint>(b[0].size()));
  ll i,j,k;
  rep(i,a.size())rep(j,b.size())rep(k,b[0].size()){
    res[i][k]+=a[i][j]*b[j][k];
  }
  return res;
}
vector<vector<mint>> pow(vector<vector<mint>> v,ll K){
  vector<vector<mint>> res(v.size(),vector<mint>(v.size()));
  ll i;
  rep(i,v.size())res[i][i]=1;
  if(K&1)res=move(prod(res,v));
  while(K){
    K>>=1;
    v=move(prod(v,v));
    if(K&1)res=move(prod(res,v));
  }
  return res;
}
mint p,q;
ll S,T,K;
int main(){
  startupcpp();
  ll i,j;
  cin>>i>>j>>S;
  p=mint(i)/j;
  cin>>i>>j>>T>>K;
  q=mint(i)/j;
  vector<vector<mint>> A(S+T+1,vector<mint>(S+T+1,0));
  A[0][0]=A[S+T][S+T]=1;
  auto B=A;
  rep1(i,S+T){
    A[i][i]=1-p;
    A[S+T][S+T-i]=A[S+T][S+T+1-i]*p;
    B[i][i]=1-q;
    B[0][i]=B[0][i-1]*q;
  }
  rep1(i,S+T){
    for(j=i;j+1<S+T;++j)B[i][j+1]=B[i][j]*q;
    for(j=i;j-1>0;--j)A[i][j-1]=A[i][j]*p;
  }
  auto C=move(prod(A,B));
  vector<vector<mint>> first(S+T+1,vector<mint>(1,0));
  first[S][0]=1;
  auto E=move(pow(C,K));
  auto D=prod(E,first);
  print(D[0][0].val());
  print(D[S+T][0].val());
}