// slow i/o
#include <cstdio>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define N (1<<24)
#define M 100010
int m, n, mx, ax, my, ay, mod;
vector<int> x, y, a, b;
vector<ll> z;
vector<bool> prime;

ll solve(ll a, ll b){
	b *= a;
	return (a<mod?z[a]:0)-(b<mod?z[b]:0);
}

int main(){
	cin>>m>>n>>mx>>ax>>my>>ay>>mod;
	assert(1<=m&&m<=(ll)1e3);
	assert(m<=n&&n<=(ll)1e7);
	assert(1<=mod&&mod<=1<<24);
	assert(__builtin_popcount(mod)==1);
	assert(0<=mx&&mx<mod);
	assert(0<=ax&&ax<mod);
	assert(0<=my&&my<mod);
	assert(0<=ay&&ay<mod);
	x = y = a = b = vector<int>(m);
	z = vector<ll>(mod);
	prime = vector<bool>(mod);
	for(int i = 0; i < m; i++){
		cin>>x[i];
		assert(0<=x[i]&&x[i]<mod);
	}
	for(int i = 0; i < m; i++){
		cin>>y[i];
		assert(0<=y[i]&&y[i]<mod);
	}
	for(int i = 0; i < m; i++) z[x[i]] += y[i];
	ll xx = x[m-1], yy = y[m-1];
	for(int i = m; i < n; i++){
		xx = (xx*mx+(ll)ax)&(mod-1);
		yy = (yy*my+(ll)ay)&(mod-1);
		z[xx] += yy;
	}
	for(int i = 2; i*i<mod; i++){
		if(prime[i]) continue;
		for(int j = i*i; j<mod; j+=i){
			prime[j] = true;
		}
	}
	for(int i = 2; i < mod; i++){
		if(prime[i]) continue;
		for(int j = (mod-1)/i*i; j > 0; j-=i){
			z[j/i] += z[j];
		}
	}
	for(int i = 0; i < m; i++){
		cin>>a[i];
		assert(1<=a[i]&&a[i]<=mod);
	}
	for(int i = 0; i < m; i++){
		cin>>b[i];
		assert(1<=b[i]&&b[i]<=mod);
	}
	ll res = 0;
	for(int i = 0; i < m; i++){
		ll r = solve(a[i], b[i]);
		printf("%lld\n", r);
		res ^= r;
	}
	ll aa = a[m-1], bb = b[m-1];
	for(int i = m; i < n; i++){
		aa = ((aa*mx+(ll)ax+mod-1)&(mod-1))+1;
		bb = ((bb*my+(ll)ay+mod-1)&(mod-1))+1;
		res ^= solve(aa, bb);
	}
	cout<<res<<endl;
	return 0;
}