#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int m,n;
int mulx,addx,muly,addy,mod;
int x[1011],y[1011],a[1011],b[1011];
ll z[(1 << 24) + 11],f[(1 << 24) + 11];

int main() {
//	freopen("friend.in","r",stdin);
//	freopen("friend.out","w",stdout);
	scanf("%d%d",&m,&n);
	scanf("%d%d%d%d%d",&mulx,&addx,&muly,&addy,&mod);
	for(int i=1;i<=m;i++)
		scanf("%d",&x[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&y[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&b[i]);
	int prex = 0,prey = 0,prea = 0,preb = 0;
	for(int i=1;i<=n;i++) {
		int xi,yi,ai,bi;
		if (i <= m) {
			xi = x[i];
			yi = y[i];
			ai = a[i];
			bi = b[i];
		}
		else {
			xi = (1ll * prex * mulx + addx) % mod;
			yi = (1ll * prey * muly + addy) % mod;
			ai = (1ll * prea * mulx + addx + mod - 1) % mod + 1;
			bi = (1ll * preb * muly + addy + mod - 1) % mod + 1;
		}
		z[xi] += yi;
		prex = xi;
		prey = yi;
		prea = ai;
		preb = bi;
	}
	for(int d=1;d<mod;d++) {
		for(int k=d;k<mod;k+=d)
			f[d] += z[k];
	}
	ll ans = 0;
	prea = 0;
	preb = 0;
	for(int i=1;i<=n;i++) {
		int ai,bi;
		if (i <= m) {
			ai = a[i];
			bi = b[i];
		}
		else {
			ai = (1ll * prea * mulx + addx + mod - 1) % mod + 1;
			bi = (1ll * preb * muly + addy + mod - 1) % mod + 1;
		}
		ll ab = 1ll * ai * bi;
		ll cntf = 0,cntl = 0;
		if (ai < mod)
			cntf = f[ai];
		if (ab < mod)
			cntl = f[ab];
		ll res = cntf - cntl;
		if (i <= m)
			printf("%lld\n",res);
		ans ^= res;
		prea = ai;
		preb = bi;
	}
	printf("%lld",ans);
	return 0;
}