#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(n), y(n), a(n), b(n), z(mod);

  REP(i,m){
    x[i] = X[i];
    y[i] = Y[i];
    a[i] = A[i];
    b[i] = B[i];
  }

  FOR(i,m,n){
    x[i] = (x[i-1] * mulX + addX) % mod;
    y[i] = (y[i-1] * mulY + addY) % mod;
    a[i] = (a[i-1] * mulX + addX + mod - 1) % mod + 1;
    b[i] = (b[i-1] * mulY + addY + mod - 1) % mod + 1;
  }
  
  REP(i,n){
    z[x[i]] += y[i];
  }

  int64_t ans = 0;

  REP(i,n){
    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];
    }

    if(i < m){
      cout << t << endl;
    }

    ans ^= t;
  }

  cout << ans << endl;

  return 0;
}