#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
// #define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

char op;
inline ll f(ll a,ll b){
    if(op=='+')         return a+b;
    else                return a*b;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    ll n,m,k;cin>>n>>m>>k;
    ll mod=k;
    char op;cin>>op;
    vector<ll> a(n),b(m);
    rep(i,m) cin>>b[i];
    rep(i,n) cin>>a[i];
    ll ans=0;
    if(op=='+'){
        rep(i,n){
            ans+=a[i]*m%mod;
            ans%=mod;
        }
        rep(i,m){
            ans+=b[i]*n%mod;
            ans%=mod;
        }
        cout<<ans<<endl;
    }
    else{
        ll sum=0;
        rep(i,n){
            sum+=a[i];sum%=mod;
        }
        rep(j,m){
            ans+=sum*b[j]%mod;
            ans%=mod;
        }
        cout<<ans<<endl;
    }
    return 0;
}