#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
//const ll MOD=1e9+7;

int M,N;
ll addX,mulX,addY,mulY,MOD;

vector<ll> X,Y,A,B;

ll val[(1ll<<24)];

int main(){
  cin>>M>>N;
  cin>>mulX>>addX>>mulY>>addY>>MOD;

  X.resize(M);
  Y.resize(M);
  A.resize(M);
  B.resize(M);
  rep(i,M) cin>>X[i];
  rep(i,M) cin>>Y[i];
  rep(i,M) cin>>A[i];
  rep(i,M) cin>>B[i];

  rep(i,M) val[X[i]]+=Y[i];

  ll sum=0;
  for(int i=0;i<M;i++) sum+=Y[i];

  ll x=X.back(),y=Y.back();
  for(int i=M;i<N;i++){
      x=(x*mulX+addX)%MOD;
      y=(y*mulY+addY)%MOD;
      val[x]+=y;
      sum+=y;
  }

  for(int i=1;i<MOD;i++){
      ll res=val[i];
      for(ll j=2;i*j<MOD;j++) res+=val[i*j];
      val[i]=res;
  }

  ll ans=0;

  for(int i=0;i<M;i++){
      ll res=0;
      if(A[i]*B[i]<MOD) res=val[A[i]]-val[A[i]*B[i]];
      else res=val[A[i]];
      ans^=res;
      cout<<res<<endl;
  }

  ll a=A.back(),b=B.back();
  for(int i=M;i<N;i++){
      a=(a*mulX+addX+MOD-1)%MOD+1;
      b=(b*mulY+addY+MOD-1)%MOD+1;

      if(a*b<MOD) ans^=(val[a]-val[a*b]);
      else ans^=val[a];
  }
  cout<<ans<<endl;

  return 0;
}