#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//const ll mod = 1000000007;
//const ll INF = mod * mod;
typedef pair<int, int>P;
typedef pair<int, bool> sP;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;

ll z[(1 << 24)+1];
int a[1000];
int b[1000];
int x[1000]; int y[1000];
int X[1000], Y[1000], A[1000], B[1000];
int m, n, mulx, addx, muly, addy, mod;
ll xsum=0;
void generate() {
	int prex, prey,prea,preb;
	rep(i, m) {
		x[i] = X[i];
		y[i] = Y[i];
		a[i] = A[i];
		b[i] = B[i];
		z[x[i]] += y[i];
	}
	prex = x[m - 1], prey = y[m - 1], prea = a[m - 1], preb = b[m - 1];
	Rep(i, m, n) {
		prex = ((ll)prex*mulx + addx) &(mod-1);
		prey = ((ll)prey*muly + addy)&(mod - 1);
		z[prex] += prey;
	}
	rep1(i, mod) {
		z[0] += z[i];
		for (int j = 2 * i; j < mod; j += i) {
			z[i] += z[j];
		}
		//cout <<"! "<< z[i] << endl;
	}
	Rep(i, m, n) {
		//cout << prea << " bef " << preb << endl;
		prea = (((ll)prea * mulx + addx + mod - 1)&(mod-1)) + 1;
		preb = (((ll)preb * muly + addy + mod - 1)&(mod - 1)) + 1;
		ll csum = z[prea];
		if ((ll)prea*preb <= mod)csum -= z[prea*preb];
		//cout << prea << " aft " << preb << endl;
		//cout << csum << endl;
		xsum ^= csum;
	}

}
void solve() {
	cin >> m >> n >> mulx >> addx >> muly >> addy >> mod;
	rep(i, m)cin >> X[i];
	rep(i, m)cin >> Y[i];
	rep(i, m)cin >> A[i];
	rep(i, m)cin >> B[i];
	generate();
	rep(i, m) {
		ll ans = z[a[i]];
		if ((ll)a[i] * b[i] <= mod) {
			ans -= z[a[i] * b[i]];
		}
		cout << ans << endl;
		xsum ^= ans;
	}

	cout << xsum << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//init();
	solve();
	//stop
	return 0;
}