#include <cstdio>
#include <cassert>
using namespace std;
typedef long long ll;
#define N (1<<24)
#define M 100
int m, n, mx, ax, my, ay, mod, mod2;
ll x[M], y[M], z[N], a[M], b[M];
bool prime[N];

void solve(ll a, ll b){
	b *= a;
	printf("%lld\n", (a<mod?z[a]:0)-(b<mod?z[b]:0));
}

int main(){
	scanf("%d%d%d%d%d%d%d%d",&m,&n,&mx,&ax,&my,&ay,&mod,&mod2);
	/*assert(1<=m&&m<=100);
	assert(m<=n&&n<=10000000);
	assert(1<=mod&&mod<=1<<23);
	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);*/
	for(int i = 0; i < m; i++) scanf("%d", x+i);
	for(int i = 0; i < m; i++) scanf("%d", y+i);
	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+ax)&(mod-1);
		yy = (yy*my+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++) scanf("%d", a+i);
	for(int i = 0; i < m; i++) scanf("%d", b+i);
	for(int i = 0; i < m; i++) solve(a[i], b[i]);
	ll aa = a[m-1], bb = b[m-1];
	for(int i = m; i < n; i++){
		aa = (aa*mx+ax+mod2-1)&(mod2-1)+1;
		bb = (bb*my+ay+mod2-1)&(mod2-1)+1;
		solve(aa, bb);
	}
}