#include<stdio.h>
#include<iostream>

int main(void)
{
	int A,B,C,D,S,T,N,K,tS,n;
	int *vecS,*vecT;
	std::cin >> A >> B >> C >> D >> S >> T >> N >> K;
	if(N=0)
	{
		std::cout << "1 1\n";
		return 0;
	}
	vecS = new int[K];
	vecT = new int[K];
	vecS[0] = (S%K+K)%K;
	vecT[0] = (T%K+K)%K;
	int index = 0;
	int cycle_len,cycle_start;
	bool cyclefound = false;
	
	
	do
	{
		vecS[index+1] = ((A*vecS[index]+B*vecT[index])%K+K)%K;
		vecT[index+1] = ((C*vecS[index]+D*vecT[index])%K+K)%K;
		//std::cout << vecS[index+1] << " " << vecT[index+1] << std::endl;
		index++;
		for(int i=index-1; i>=0; i--)
		{
			if((vecS[index] == vecS[i]) && (vecT[index] == vecT[i]))
			{
				cycle_start = i;
				cycle_len = index - i + 1;
				cyclefound = true;
				break;
			}
		}
	}while(!cyclefound);
	
	n = (N-cycle_start)%cycle_len + cycle_start;
	
	std::cout << vecS[n] << " " << vecT[n] << "\n";
	delete[] vecS;
	delete[] vecT;
	return 0;
}