#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;


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

  vector<int> X(m), Y(m), A(m), B(m);
  cin >> X >> Y >> A >> B;

  vector<int64_t> x(2), y(2), a(2), b(2);
  vector<int64_t> z(mod);

  REP(i,m){
    z[X[i]] += Y[i];
  }
  
  int cur=0, nxt=1;
  x[cur] = X[m-1];
  y[cur] = Y[m-1];
  
  FOR(i,m,n){
    x[nxt] = (x[cur] * mulX + addX) % mod;
    y[nxt] = (y[cur] * mulY + addY) % mod;

    z[x[nxt]] += y[nxt];
    
    cur ^= 1;
    nxt ^= 1;
  }

  
  int64_t ans = 0;

  
  REP(i,m){
    int64_t t = 0;

    for(int64_t j = A[i]; j < mod; j += A[i]){
      t += z[j];
    }

    for(int64_t j = A[i]*B[i]; j < mod; j += A[i]*B[i]){
      t -= z[j];
    }

    cout << t << endl;

    ans ^= t;
  }

  cur=0, nxt=1;
  a[cur] = A[m-1];
  b[cur] = B[m-1];

  FOR(i,m,n){
    a[nxt] = (a[cur] * mulX + addX + mod - 1) % mod + 1;
    b[nxt] = (b[cur] * mulY + addY + mod - 1) % mod + 1;
    
    int64_t t = 0;

    for(int64_t j = a[nxt]; j < mod; j += a[nxt]){
      t += z[j];
    }

    for(int64_t j = a[nxt]*b[nxt]; j < mod; j += a[nxt]*b[nxt]){
      t -= z[j];
    }


    ans ^= t;

    cur ^= 1;
    nxt ^= 1;
  }
  


  cout << ans << endl;

  return 0;
}