#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)

template<typename T> bool chmax(T& a, T b) { return a<b ? a=b, true : false; }
template<typename T> bool chmin(T& a, T b) { return a>b ? a=b, true : false; }
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;

#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif



template<typename T>
vector<vector<T>> MatMul(const vector<vector<T>>& A, const vector<vector<T>>& B) {
    int N=A.size();
    vector<vector<T>> ret(N,vector<T>(N));
    for(int i=0; i<N; i++) for(int j=0; j<N; j++) for(int k=0; k<N; k++) {
        ret[i][j]+=A[i][k]*B[k][j];
    }
    return ret;
}

template<typename T>
vector<vector<T>> MatPow(vector<vector<T>> A, ll b) {
    int N=A.size();
    vector<vector<T>> ret(N,vector<T>(N));
    for(int i=0; i<N; i++) ret[i][i]=1;
    while(b) {
        if(b&1) ret=MatMul(ret,A);
        A=MatMul(A,A);
        b>>=1;
    }
    return ret;
}


/// @brief 実行時に mod を変更できる ModInt
struct ModIntDynamic {
    ll value;
    static ll mod;
    static void set_mod(ll x) { mod=x; }
    static ll get_mod() { return mod; }
    ModIntDynamic(ll x=0) {
        if(x>=0) value=x%mod;
        else value=mod-(-x)%mod;
    }
    ModIntDynamic operator-() const { return ModIntDynamic(-value); }
    ModIntDynamic operator+() const { return ModIntDynamic(*this); }
    ModIntDynamic& operator+=(const ModIntDynamic& other) {
        value+=other.value;
        if(value>=mod) value-=mod;
        return*this;
    }
    ModIntDynamic& operator-=(const ModIntDynamic& other) {
        value+=mod-other.value;
        if(value>=mod) value-=mod;
        return*this;
    }
    ModIntDynamic& operator*=(const ModIntDynamic other) {
        value=value*other.value%mod;
        return*this;
    }
    ModIntDynamic& operator/=(ModIntDynamic other) {
        (*this)*=other.inv();
        return*this;
    }
    ModIntDynamic operator+(const ModIntDynamic& other) const { return ModIntDynamic(*this)+=other; }
    ModIntDynamic operator-(const ModIntDynamic& other) const { return ModIntDynamic(*this)-=other; }
    ModIntDynamic operator*(const ModIntDynamic& other) const { return ModIntDynamic(*this)*=other; }
    ModIntDynamic operator/(const ModIntDynamic& other) const { return ModIntDynamic(*this)/=other; }
    ModIntDynamic pow(ll x) const {
        ModIntDynamic ret(1),mul(value);
        while(x) {
            if(x&1) ret*=mul;
            mul*=mul;
            x>>=1;
        }
        return ret;
    }
    ModIntDynamic inv() const { return pow(mod-2); }
    bool operator==(const ModIntDynamic& other) const { return value==other.value; }
    bool operator!=(const ModIntDynamic& other) const { return value!=other.value; }
    friend ostream& operator<<(ostream& os, const ModIntDynamic& x) { return os<<x.value; }
    friend istream& operator>>(istream& is, ModIntDynamic& x) {
        ll v;
        is>>v;
        x=ModIntDynamic(v);
        return is;
    }
};
ll ModIntDynamic::mod=998244353;

//----------------------------------------------------------

void solve() {
    ll A,B,C,D,S,T,N,K;
    cin>>A>>B>>C>>D>>S>>T>>N>>K;

    using MID=ModIntDynamic;
    MID::set_mod(K);

    vector<vector<MID>> M={{A,B},{C,D}};
    M=MatPow(M,N);

    cout<<M[0][0]*S+M[0][1]*T<<' '<<M[1][0]*S+M[1][1]*T<<endl;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cout<<fixed<<setprecision(15);
    int T=1;
    //cin>>T;
    while(T--) solve();
}