#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int m, n, mulx, addx, muly, addy, mod;
ll z[1<<24];
int a[1010], b[1010], x[1010], y[1010];
const int MAX=1<<24;
bool isprime[MAX];
void sieve(){
	for(ll i=3; i<MAX; i+=2){
		isprime[i]=1;
	}
	isprime[2]=1;
	for(ll i=3; i<MAX; i++){
		if(isprime[i]){
			for(ll j=2*i; j<MAX; j+=i){
				isprime[j]=0;
			}
		}
	}
	return;
}
int main()
{
	cin>>m>>n>>mulx>>addx>>muly>>addy>>mod;
	sieve();
	for(int i=1; i<=m; i++) cin>>x[i];
	for(int i=1; i<=m; i++) cin>>y[i];
	for(int i=1; i<=m; i++) cin>>a[i];
	for(int i=1; i<=m; i++) cin>>b[i];
	for(int i=1; i<=m; i++){
		z[x[i]]+=y[i];
	}
	ll x1=x[m], y1=y[m];
	for(int i=m+1; i<=n; i++){
		x1=((x1*mulx+addx)&(mod-1));
		y1=((y1*muly+addy)&(mod-1));
		z[x1]+=y1;
	}
	for(int i=2; i<mod; i++){
		if(!isprime[i]) continue;
		for(int j=(mod-1)/i*i; j>0; j-=i){
			z[j/i]+=z[j];
		}
	}
	ll ans=0;
	for(int i=1; i<=m; i++){
		ll ans1=0;
		if(a[i]<mod) ans1+=z[a[i]];
		if((ll)a[i]*b[i]<mod) ans1-=z[a[i]*b[i]];
		cout<<ans1<<endl;
		ans^=ans1;
	}
	ll a1=a[m], b1=b[m];
	for(int i=m+1; i<=n; i++){
		a1=((a1*mulx+addx+mod-1)&(mod-1))+1;
		b1=((b1*muly+addy+mod-1)&(mod-1))+1;
		ll ans1=0;
		if(a1<mod) ans1+=z[a1];
		if(a1*b1<mod) ans1-=z[a1*b1];
		ans^=ans1;
	}
	cout<<ans<<endl;
	return 0;
}