#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


//O(N^3logk)
//https://yukicoder.me/submissions/733933
//https://atcoder.jp/contests/abc236/submissions/28778130
using vec=vector<ll>;
using matrix=vector<vector<ll>>;
matrix matmul(matrix &left,matrix &right,ll K){
    int n=left.size();
    matrix ret(n,vec(n));//+の単位元で埋める
    for(int i=0;i<n;i++){
        for(int k=0;k<n;k++){//ループ順序の最適化
            for(int j=0;j<n;j++){
                ret[i][j]+=left[i][k]*right[k][j];
                ret[i][j]%=K;
            }
        }
    }
    return ret;
}
matrix matpow(matrix &mat,ll k,ll mod){
    int n=mat.size();
    matrix ret(n,vec(n));//+の単位元で埋める
    for(int i=0;i<n;i++)ret[i][i]=1;//*の単位元で埋める
    while(k){
        if(k&1)ret=matmul(mat,ret,mod);
        k>>=1;
        if(k)mat=matmul(mat,mat,mod);
    }
    return ret;
}
vec update(matrix &mat,vec &v,ll k){
    int n=mat.size();
    vec ret(n);//+の単位元で埋める
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            ret[i]+=mat[i][j]*v[j];
            ret[i]%=k;
        }
    }
    return ret;
}

int main(){
  ll n=2;
  vvl v(n,vl(n));
  rep(i,n)rep(j,n)cin >> v[i][j];
  vl s(n);rep(i,n)cin >> s[i];
  ll N,k;cin >> N >> k;

  rep(i,n)rep(j,n){
    v[i][j]+=k*inf;
    v[i][j]%=k;
  }
  rep(i,n){
    s[i]+=k*inf;
    s[i]%=k;
  }


  auto p=matpow(v,N,k);
  auto z=update(p,s,k);
  cout << z[0] <<" " << z[1] << endl;
}