#include <fstream>
#include <iostream>
using namespace std;

int T0, T1, a, b, x, y, z, M, n;

struct State {
    int fst;
    int snd;

}head, slow, quick;

bool operator==(const State& lhs, const State& rhs) {
    return lhs.fst == rhs.fst && lhs.snd == rhs.snd;
}

bool operator!=(const State& lhs, const State& rhs) {
    return !(lhs.fst == rhs.fst && lhs.snd == rhs.snd);
}



void GoNext(State& state) {
    int p = state.snd;
    int pp = state.fst;
    state.fst = p;
    int newNode = a*(pp^2) + b*(p^2) + x*pp + y*p + z;
    state.snd = newNode%M;
}

int main() {
    
    ifstream f("rsir.in");
    ofstream g("rsir.out");

    f >> T0 >> T1 >> a >> b >> x >> y >> z >> M >> n;
    
    head.fst = slow.fst = quick.fst = T0;
    head.snd = slow.snd = quick.snd = T1;
    
    do {
        GoNext(slow);
        GoNext(quick);
        GoNext(quick);
    }while(slow != quick);

    int tail = 0;
    while(head != quick) {
        GoNext(head);
        GoNext(quick);
        tail++;
        if(n == tail) {
            g << head.snd;
            return 0;
        }
    }
    int cycle = 0;

    do{
        GoNext(quick);
        cycle++;
    } while(head != quick);
    cout << cycle << endl;
    n = (n - tail)%cycle;

    while(n>0) {
        GoNext(quick);
        n--;
    }

    g << quick.fst;

    return 0;
}