#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define double long double
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
    ll n,m,k;cin>>n>>m>>k;
    vector<ll>a(n),b(m);
    char c;cin>>c;
    bool f=c=='+';
    ll ans;
    if(f)ans=0;
    else ans=0;
    rep(i,m)cin>>b[i];
    rep(i,n)cin>>a[i];
    rep(i,n){
        ans=(ans+a[i])%k;
    }
        ans=(ans*m)%k;
        ll cnt=0;
        rep(i,m){
            cnt=(cnt+b[i])%k;
        }
        if(f)cout<<(ans+cnt*n)%k<<endl;
        else{
            ans=0;
            rep(i,n){
                ans=(ans+cnt*a[i])%k;
            }
            cout<<ans<<endl;
        }
}