#include <iostream>
#include <vector>
#include <algorithm>
#define llint long long

using namespace std;

bool prime[1<<24];
llint m, n, mulX, addX, mulY, addY, mod;
llint x[1005], y[1005], z[1<<24];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> m >> n >> mulX >> addX >> mulY >> addY >> mod;
	for(int i = 1; i <= m; i++) cin >> x[i];
	for(int i = 1; i <= m; i++) cin >> y[i];
	
	llint X, Y;
	for(int i = 1; i <= n; i++){
		if(i <= m) X = x[i], Y = y[i];
		else{
			X = (X*mulX+addX) % mod;
			Y = (Y*mulY+addY) % mod;
		}
		z[X] += Y;
	}
	
	//for(int i = 0; i < mod; i++) cout << z[i] << " "; cout << endl;
	
	for(int i = 2; i < mod; i++) z[1] += z[i];
	for(int i = 2; i < (1<<24); i++){
		if(prime[i]) continue;
		for(int j = mod/i+1; j >= 2; j--){
			if(j*i >= mod) continue;
			prime[j*i] = true;
			z[j] += z[j*i];
		}
	}
	//for(int i = 0; i < mod; i++) cout << z[i] << " "; cout << endl;
	
	
	for(int i = 1; i <= m; i++) cin >> x[i];
	for(int i = 1; i <= m; i++) cin >> y[i];
	llint A, B, ans = 0;
	for(int i = 1; i <= n; i++){
		if(i <= m) A = x[i], B = y[i];
		else{
			A = (A*mulX+addX+mod-1) % mod+1;
			B = (B*mulY+addY+mod-1) % mod+1;
		}
		llint tmp = z[A];
		if(A*B < mod) tmp -= z[A*B];
		ans ^= tmp;
		//cout << A << " " << B << tmp << endl;
		if(i <= m) cout << tmp << endl;
	}
	cout << ans << endl;
	
	return 0;
}