#include <fstream>

#define LL long long
using namespace std;

ifstream cin ("rsir.in");
ofstream cout ("rsir.out");

const int MaxM = 7005;

LL t0, t1, a, b, x, y, z, M, n, tprev, tcurr, tprev2, tcurr2, CycleLength = 1;
LL A[MaxM], B[MaxM];

inline void NextElement(LL &tm2, LL &tm1) {
  LL NewT = A[tm2] + B[tm1] + z;
  while (NewT >= M) {
    NewT -= M;
  }
  tm2 = tm1;
  tm1 = NewT;
  //return (a * tm2 * tm2 % M + b * tm1 * tm1 % M + x * tm2 % M + y * tm1 % M + z) % M;
  //return (A[tm2] + B[tm1] + z) % M;
}

int main() {
  cin >> t0 >> t1 >> a >> b >> x >> y >> z >> M >> n;

  for (int i = 1; i <= M; ++i) {
    A[i] = (a * i * i + x * i) % M;
    B[i] = (b * i * i + y * i) % M;
  }

  t0 %= M;
  t1 %= M;
  tprev = t0;
  tcurr = t1;
  for (CycleLength = 0; CycleLength < n and CycleLength < M * M; ++CycleLength) {
    NextElement(tprev, tcurr);
  }

  if (CycleLength == n) {
    cout << tprev << '\n';
    return 0;
  }

  n -= CycleLength;
  tprev2 = tprev;
  tcurr2 = tcurr;
  do {
    NextElement(tprev2, tcurr2);
    ++CycleLength;
  } while (tprev2 != t0 or tcurr2 != t1);

  n %= CycleLength;
  for (int i = 1; i < n; ++i) {
    NextElement(tprev, tcurr);
  }
  cout << tcurr << '\n';
  return 0;
}