#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n, m;
    cin >> n >> m;
    ll k;
    cin >> k;
    char op;
    cin >> op;
    ll a[n], b[m];
    rep(i,m)cin >> b[i];
    rep(i,n)cin >> a[i];

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