#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"rsir.in"};
const char OUT[] = {"rsir.out"};
const int INF = 1000000005;

#define II inline
#define LL long long
#define fs first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
//#define all(a) a, a + 

int a, b, x, y, z, tzero, tunu;
int N, M;
int t1[3], t2[3];
int drum = 2, ciclu;

void citi()
{
	scanf("%d%d%d%d%d%d%d%d%d", &tzero, &tunu, &a, &b, &x, &y, &z, &M, &N);
	t2[0] = t1[0] = tzero;
	t2[1] = t1[1] = tunu;
}

inline void aduna(int &k, int &l, int &m)
{
	k = (a*m*m + b*l*l + x*m + y*l + z) % M;
}

void detect_ciclu()
{
	int i, j;
	for(i = 2, j = 2 ; i == 2 || (t1[i%3] != t2[j%3] || t1[(i - 1)%3] != t2[(j - 1)%3]) ; i++, j++)
	{
		aduna(t1[i%3], t1[(i - 1)%3], t1[(i - 2)%3]);
		aduna(t2[j%3], t2[(j - 1)%3], t2[(j - 2)%3]);
		j++;
		aduna(t2[j%3], t2[(j - 1)%3], t2[(j - 2)%3]);
	}
	t2[0] = tzero;t2[1] = tunu;
	for(; t1[i%3] != t2[drum%3] || t1[(i - 1)%3] != t2[(drum - 1)%3] ; i++, drum++)
	{
		aduna(t1[i%3], t1[(i - 1)%3], t1[(i - 2)%3]);
		aduna(t2[drum%3], t2[(drum - 1)%3], t2[(drum - 2)%3]);
	}
	for(i = drum ; i == 2 || t1[i%3] != t2[drum%3] || t1[(i - 1)%3] != t2[(drum - 1)%3] ; i++)
		aduna(t1[i%3], t1[(i - 1)%3], t1[(i - 2)%3]);
	ciclu = i - drum;
	drum--;
	
	if(N > drum)
		N = ((N - drum) - 1) % ciclu + 1 + drum;
	t1[0] = tzero;t1[1] = tunu;
	FOR(i, 2, N)
		aduna(t1[i%3], t1[(i - 1)%3], t1[(i - 2)%3]);
}

void scrie()
{
	printf("%d\n", t1[N%3]);
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	citi();
	detect_ciclu();
	scrie();
	return 0;
}