#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;

int main()
{
    int m, n;
    long long mulX, addX, mulY, addY, mod;
    cin >> m >> n >> mulX >> addX >> mulY >> addY >> mod;

    vector<vector<int> > input(4, vector<int>(m));
    for(int i=0; i<4; ++i){
        for(int j=0; j<m; ++j){
            cin >> input[i][j];
        }
    }

    long long x = 0;
    long long y = 0;
    vector<long long> cnt(mod+1, 0);
    for(int i=0; i<n; ++i){
        if(i < m){
            x = input[0][i];
            y = input[1][i];
        }
        else{
            x = (x * mulX + addX) & (mod - 1);
            y = (y * mulY + addY) & (mod - 1);
        }
        cnt[x] += y;
    }
    vector<long long> sum(mod+1, 0);
    for(int i=1; i<=mod; ++i){
        for(int j=i; j<=mod; j+=i){
            sum[i] += cnt[j];
        }
    }

    long long a = 0;
    long long b = 0;
    long long ans = 0;
    for(int i=0; i<n; ++i){
        if(i < m){
            a = input[2][i];
            b = input[3][i];
        }
        else{
            a = ((a * mulX + addX + mod - 1) & (mod - 1)) + 1;
            b = ((b * mulY + addY + mod - 1) & (mod - 1)) + 1;
        }

        long long tmp = sum[a];
        if(a * b <= mod)
            tmp -= sum[a*b];
        if(i < m)
            cout << tmp << endl;
        ans ^= tmp;
    }
    cout << ans << endl;

    return 0;
}