#include <stdio.h>

#include <deque>

using namespace std;

#define ll long long

#define pb push_back

#define pf push_front

const ll maxN=1e7+;

ll n, A, B, C, x, a, b, MOD;

ll M = 1e9 + , ans;

deque<ll> dq, stk;

int main() {

#ifndef ONLINE_JUDGE

    freopen("data.in", "r", stdin);

#endif

    scanf("%lld%lld%lld%lld %lld%lld%lld%lld",

            &n, &A, &B, &C, &x, &a, &b, &MOD);

    ans = ;

    for (ll i = ; i <= n; ++i) {

        x = (x * a + b) % MOD;

        ll xabc = x % (A + B + C);

        if (xabc < A || dq.size() <= ) {

            dq.pb(x);

            if (stk.empty() || x >= stk.back())

                stk.push_back(x);

            ans = (ans + stk.back()) % M;

        } else if (A <= xabc && xabc < A + B){

            dq.pf(x);

            while (stk.size() && x > stk.front())

                stk.pop_front();

            stk.push_front(x);

            ans = (ans + stk.back()) % M;

        } else if (A + B <= xabc) {

            ll out = dq.back();

            dq.pop_back();

            if (out == stk.back())

                stk.pop_back();

            ans = (ans + stk.back()) % M;

        }

    }

    printf("%lld\n", ans);

    return ;

}