#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int N=1e7+5;
const int mod=1e9+7;
int n,a[N],b[N];
int q[N*2],head,tail,st[N*2],first,last;
LL A,B,C,x,aa,bb,MOD;
int main(){
	scanf("%d%lld%lld%lld%lld%lld%lld%lld",&n,&A,&B,&C,&x,&aa,&bb,&MOD);
	for (int i=1,tot=0;i<=n;i++){
		x=(x*aa+bb)%MOD;
		LL xx=x%(A+B+C);
		if (tot<=1||xx<A)
			a[i]=0,b[i]=x,tot++;
		else if (A<=xx&&xx<A+B)
			a[i]=1,b[i]=x,tot++;
		else
			a[i]=2,tot--;
	}
	head=1e7+2,tail=head;
	first=head,last=tail;
	int ans=0;
	for (int i=1;i<=n;i++){
		if (a[i]==0){
			st[++last]=b[i];
			if (q[tail]<=b[i])
				q[++tail]=b[i];
		}
		else if (a[i]==1){
			st[first--]=b[i];
			while (head<tail&&q[head+1]<b[i])
				head++;
			q[head--]=b[i];
		}
		else {
			if (q[tail]==st[last])
				tail--;
			last--;
		}
		ans=(ans+q[tail])%mod;
	}
	printf("%d",ans);
	return 0;
}