#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#include<complex>
#include<chrono>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
using namespace std;
//ここから
void solve(){
  ll n,m,k;
  cin>>n>>m>>k;
  char op;
  cin>>op;
  vector<ll>b(m),a(n);
  rep(i,m)cin>>b[i];
  rep(i,n)cin>>a[i];
  ll sum=0,sum2=0;
  if(op=='+'){
    rep(i,n)sum+=a[i];
    rep(j,m)sum2+=b[j];
    sum*=m;
    sum2*=n;
    sum+=sum2;
    cout<<sum%k<<"\n";
  }
  else {
    rep(i,n)sum+=a[i];
    rep(j,m)sum2+=b[j];
    sum%=k;sum2%=k;
    cout<<(sum*sum2)%k<<"\n";
  }
}

int main(){
	ios::sync_with_stdio(false);
  cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}