#include<iostream>

#include<cstring>

#include<cstdlib>

#include<cstdio>

#include<deque>

#define MOD(x) ((x)>=modd?(x)-modd:(x))

using namespace std;

const int maxn=, modd=1e9+;

deque<int>ds;

int n, A, B, C, a, b, mod, tott, ans;

int x[maxn], q[maxn], ty[maxn], mx[maxn];

int main()

{

    scanf("%d%d%d%d%d%d%d%d", &n, &A, &B, &C, &x[], &a, &b, &mod);

    int l=, r=;

    for(int i=;i<=n;i++)

    {

        x[i]=(1ll*x[i-]*a+b)%mod;

        if(x[i]%(A+B+C)<A || ds.size()<=) ty[i]=;

        else if(x[i]%(A+B+C)<A+B) ty[i]=;

        else if(A+B<=x[i]%(A+B+C)) ty[i]=;

        if(!ty[i]) ds.push_front(i), ++tott, mx[tott]=max(mx[tott-], x[i]);

        else if(ty[i]==)

        {

            ds.push_back(i);

            while(l<=r && x[q[r]]<=x[i]) r--;

            q[++r]=i;

        }

        else

        {

            int delta=ds.front(); ds.pop_front();

            if(ty[delta]) {if(q[l]==delta) l++;}

            else --tott;

        }

        ans+=max(mx[tott], q[l]?x[q[l]]:); ans=MOD(ans);

    }

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

}