#include using namespace std; #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define All(v) (v).begin(), (v).end() #define pb push_back #define MP(a, b) make_pair((a), (b)) template vector make_vec(size_t a, T val) { return vector(a, val); } template auto make_vec(size_t a, Ts... ts) { return vector(a, make_vec(ts...)); } using ll = long long; using pii = pair; using pll = pair; using Graph = vector>; template struct edge { int to; T cost; edge(int t, T c) : to(t), cost(c) {} }; template using WGraph = vector>>; template inline T read() { T t; cin >> t; return t; } template inline tuple reads() { return {read()...}; } const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; int main() { auto [N, M, K] = reads(); char op = read(); vector A(N), B(M); rep(i, M) { B[i] = read(); } ll sum = 0; rep(i, N) { A[i] = read(); sum += A[i]; } ll res = 0; rep(i, M) { if(op == '+') { res += (sum + (B[i] * N)) % K; res %= K; } else { res += (B[i] * sum) % K; res %= K; } } cout << res << endl; }