#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)



ll K;
ll MOD;

typedef vector<ll> vi;
typedef vector<vi> vvi;


typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;


vvl mul(vvl X, vvl Y) {
	vvl Z(X.size(),vl(Y[0].size()));
	REP(i,X.size()){
		REP(k,Y.size()){
			REP(j,Y[0].size()){
				Z[i][j]=(Z[i][j]+X[i][k]*Y[k][j])%MOD;
			}
		}
	}

	return Z;
}


vvl pow(vvl A,ll n){

	vvl B(A.size(),vl(A[0].size()));

	REP(i,B.size()) B[i][i]=1;

	while(n>0){

		if (n%2==1) B=mul(B,A);

		A=mul(A,A);
		n/=2;
	}

	return B;
}


ll modpow(ll x,ll n){
    ll res=1;
    while(n!=0LL){
	if(n%2!=0LL) res=(res*x)%MOD;
	x=(x*x)%MOD;
	n/=2;
   }
    return res;
}







int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;





	ll A,B,C,D,S,T,N;
	cin >> A >> B >> C >> D >> S >> T >> N >> K;


	MOD=K;

	vvi a(2,vi(2));

	if(A<0) A+=(-A+K-1)/K*K;
	if(B<0) B+=(-B+K-1)/K*K;
	if(C<0) C+=(-C+K-1)/K*K;
	if(D<0) D+=(-D+K-1)/K*K;

	a[0][0]=A;
	a[0][1]=B;
	a[1][0]=C;
	a[1][1]=D;

	a=pow(a,N);


	ll x=a[0][0]*S+a[0][1]*T;
	ll y=a[1][0]*S+a[1][1]*T;

	if(x<0) x+=(-x+K-1)/K*K;
	if(y<0) y+=(-y+K-1)/K*K;

	cout << x%K << ' ' << y%K << endl;







	return 0;

}