#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, m, k;
    char op;
    cin >> n >> m >> k >> op;
    vector<int32_t> bs(m);
    for (auto i = 0; i < m; ++i) {
        cin >> bs[i];
    }
    vector<int32_t> as(n);
    for (auto i = 0; i < n; ++i) {
        cin >> as[i];
    }
    int64_t asum = 0;
    for (auto i = 0; i < n; ++i) {
        asum = (asum + as[i]) % k;
    }
    int64_t bsum = 0;
    for (auto i = 0; i < m; ++i) {
        bsum = (bsum + bs[i]) % k;
    }
    int64_t ans;
    if (op == '+') {
        ans = m * asum % k;
        ans = (ans + n * bsum % k) % k;
    } else {
        ans = asum * bsum % k;
    }
    cout << ans << endl;
    return 0;
}