#include <iostream>
#include <vector>
#define U 10000010
typedef long long ll;

using namespace std;

bool is_prime[U];
vector<int> primes;
ll dp[U];
ll X[1010];
ll Y[1010];
ll A[1010];
ll B[1010];

int M, N, mX, aX, mY, aY, MOD;

void make_prime_table()
{
    for (int i = 2; i < U; i++)
    {
        is_prime[i] = true;
    }
    for (int p = 2; p < U; p++)
    {
        if (p * p >= U)
        {
            break;
        }
        for (int n = p * p; n < U; n += p)
        {
            is_prime[n] = false;
        }
    }
    primes.push_back(2);
    for (int p = 3; p < U; p += 2)
    {
        if (is_prime[p])
        {
            primes.push_back(p);
        }
    }
}

void get_input()
{
    cin >> M >> N >> mX >> aX >> mY >> aY >> MOD;
    for (int i = 0; i < M; i++)
    {
        cin >> X[i];
    }
    for (int i = 0; i < M; i++)
    {
        cin >> Y[i];
    }
    for (int i = 0; i < M; i++)
    {
        cin >> A[i];
    }
    for (int i = 0; i < M; i++)
    {
        cin >> B[i];
    }
}

void XY()
{
    for (int i = 0; i < M; i++)
    {
        dp[X[i]] += Y[i];
    }
    ll x = X[M - 1];
    ll y = Y[M - 1];
    ll mask = MOD - 1;
    for (int i = M; i < N; i++)
    {
        x = (x * mX + aX) & mask;
        y = (y * mY + aY) & mask;
        dp[x] += y;
    }
}

void zeta()
{
    for (int p : primes)
    {
        for (int i = (U - 1) / p; i > 0; i--)
        {
            dp[i] += dp[p * i];
        }
    }
}

int f(ll a, ll b)
{
    ll x;
    x = dp[a];
    if (a * b < U)
        x -= dp[a * b];
    return x;
}

void AB()
{
    ll ans = 0;
    ll a, b, x;
    for (int i = 0; i < M; i++)
    {
        x = f(A[i], B[i]);
        cout << x << endl;
        ans ^= x;
    }
    a = A[M - 1];
    b = B[M - 1];
    ll mask = MOD - 1;
    for (int i = M; i < N; i++)
    {
        a = (a * mX + aX) & mask;
        b = (b * mY + aY) & mask;
        ans ^= f(a, b);
    }
    cout << ans << endl;
}

int main()
{
    make_prime_table();
    get_input();
    XY();
    zeta();
    AB();
    return 0;
}