#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
 
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  
  ll n,m,k;
  cin >> n >> m >> k;
  char t;
  cin >> t;
  ll b[m];
  rep(i,m) cin >> b[i];
  ll sum = 0;
  rep(i,n){
    ll a;
    cin >> a;
    sum += a;
    sum %= k;
  }
  
  ll ans = 0;
  if(t == '+'){
    rep(i,m){
      ans += n*b[i]+sum;
      ans %= k;
    }
  }
  else{
    rep(i,m){
      ans += sum*b[i];
      ans %= k;
    }
  }
  cout << ans << endl;
  return 0;
}