#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

int main() {
    int64 n,m,k;
    int64 ans = 0;
    cin >> n >> m >> k;
    vector<int64> b(m);
    vector<int64> a(n);

    char op; cin >> op; bool plus = op == '+';
    for (int i=0; i<m; i++) cin >> b[i];
    for (int i=0; i<n; i++) cin >> a[i];

    auto sum = [&](int64 acc, int64 x) {acc+=x; return acc % k;};
    int64 bsum = accumulate(b.begin(), b.end(), 0LL, sum);
    int64 asum = accumulate(a.begin(), a.end(), 0LL, sum);

    asum %= k;
    bsum %= k;
    if (plus) {
        ans += n * bsum;
        ans += m * asum;
    } else {
        ans += bsum * asum;
    }
    ans %= k;

    cout << ans << endl;
}