#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
using namespace std;
#define modPHash (ll)((1LL<<61)-1)
#define modP (ll)998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

vector<vector<ll>> mul(vector<vector<ll>>& A, vector<vector<ll>>& B, int size) {
	vector<vector<ll>>res;
	for (int i = 0; i < size; i++) {
		vector<ll>row;
		for (int j = 0; j < size; j++) {
			ll tmp = 0;
			for (int k = 0; k < size; k++) {
				tmp += A[i][k] * B[k][j];
			}
			row.push_back(tmp);
		}
		res.push_back(row);
	}
	return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	vector<ll>I(2);
	vector<vector<ll>>A(2, I);
	for (int i = 0;i < 2;i++) {
		for (int j = 0;j < 2;j++) {
			cin >> A[i][j];
		}
	}
	ll S, T, N, K;
	cin >> S >> T >> N >> K;
	for (int i = 0;i < 2;i++) {
		for (int j = 0;j < 2;j++) {
			A[i][j] %= K;
			A[i][j] += K;
			A[i][j] %= K;
		}
	}
	S %= K;
	S += K;
	S %= K;
	T %= K;
	T += K;
	T %= K;
	vector<vector<ll>> EX[64];
	EX[0] = A;
	for (int k = 1;k < 64;k++) {
		EX[k] = mul(EX[k - 1], EX[k - 1], 2);
		for (int i = 0;i < 2;i++) {
			for (int j = 0;j < 2;j++) {
				EX[k][i][j] %= K;
			}
		}
	}
	for (int k = 0;k < 64;k++) {
		if ((N >> k) & 1) {
			ll SS = (S * EX[k][0][0] + T * EX[k][0][1]) % K;
			ll TT = (S * EX[k][1][0] + T * EX[k][1][1]) % K;
			S = SS;
			T = TT;
		}
	}
	cout << S << " " << T;
    return 0;
}