#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int n,m; cin >> n >> m;
    ll k; cin >> k;
    char c; cin >> c;
    vector<ll> b(m),a(n);
    for(int i=0;i<m;i++){
        cin >> b[i];
    }
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    if(c=='+'){
        ll sum=0;
        for(int i=0;i<n;i++){
            (sum+=a[i]*m%k)%=k;
        }
        for(int i=0;i<m;i++){
            (sum+=b[i]*n%k)%=k;
        }
        cout << sum << endl;
    }
    else{
        ll sum=0;
        ll sum2=0;
        for(int i=0;i<n;i++){
            sum+=a[i];
        }
        for(int i=0;i<m;i++){
            sum2+=b[i];
        }
        sum%=k;
        sum2%=k;
        cout << sum*sum2%k << endl;
    }
}