#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

const int mmax = 7005;

int t0, t1, i, a, b, x, y, z, m, cnt, cycle;
int A[mmax], B[mmax];
ll n;

pii p1, p2;

pii next_pair(pii x)
{
    pii mlc;

    mlc.fi = x.se;
    mlc.se = A[x.fi] + B[x.se];
    if(mlc.se >= m)
        mlc.se -= m;

    return mlc;
}

int main()
{
    freopen("rsir.in", "r", stdin);
    freopen("rsir.out", "w", stdout);

    scanf("%d%d", &t0, &t1);
    scanf("%d%d%d%d%d", &a, &b, &x, &y, &z);
    scanf("%d%lld", &m, &n);

    t0 %= m;
    t1 %= m;
    for(i = 0; i < m; i++)
    {
        A[i] = (1LL * a * i * i + 1LL * x * i + z) % m;
        B[i] = (1LL * b * i * i + 1LL * y * i) % m;
    }

    p1 = p2 = mp(t0, t1);
    do
    {
        cnt++;
        if(n == cnt)
        {
            printf("%d\n", p1.se);
            return 0;
        }
        p1 = next_pair(p1);
        p2 = next_pair(next_pair(p2));
    }
    while(p1 != p2);

    do
    {
        cycle++;
        p1 = next_pair(p1);
    }
    while(p1 != p2);

    n = (n - cnt) % cycle;
    if(!n) n += cycle;

    for(i = 2; i <= n; i++)
        p1 = next_pair(p1);

    printf("%d\n", p1.se);

    return 0;
}