#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    while (Q--) {

        ll n, m, k;
        cin >> n >> m >> k;
        char c;
        cin >> c;
        vector<ll>a(m), b(n);
        for (int i = 0; i < m; i++) {
            cin >> a[i];
        }
        for (int j = 0; j < n; j++)cin >> b[j];
        ll ans = 0;
        if (c == '+') {
            ll p = 0;
            for (int i = 0; i < n; i++) {
                p += b[i];
                p %= k;
                

            }
            p *= m; p %= k;
            ll r = 0;
            for (int i = 0; i < m; i++) {
                r += a[i];
                r %= k;


            }
            r *= n; r %= k;
            ans = p + r;

        }
        else {
            ll p = 0;
            for (int i = 0; i < n; i++) {
                p += b[i];
                p %= k;


            }
             p %= k;
            ll r = 0;
            for (int i = 0; i < m; i++) {
                r += a[i];
                r %= k;


            }
             r %= k;
            ans = p * r;

        }
        cout << ans%k;

    }
    return 0;
}