#include using namespace std; #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++) #define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--) #define INF (1ll<<60) #define all(x) (x).begin(),(x).end() typedef long long lint; const lint MOD =1000000007; const lint MAX = 10000000; using Graph =vector>; typedef pair P; lint fac[MAX], finv[MAX], inv[MAX]; void COMinit() // 二項係数を求める時は前処理としてCOMinit()をする { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (lint i = 2; i < MAX; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } // 二項係数計算 long long COM(lint n, lint k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } lint primary(lint num) { if (num < 2) return 0; else if (num == 2) return 1; else if (num % 2 == 0) return 0; // 偶数はあらかじめ除く double sqrtNum = sqrt(num); for (int i = 3; i <= sqrtNum; i += 2) { if (num % i == 0) { // 素数ではない return 0; } } // 素数である return 1; } int main(){ lint N,Q,K; cin>>N>>Q>>K; char s; cin>>s; lint A[Q]; lint ans1=0; lint ans2=0; rep(i,Q){ cin>>A[i]; ans1+=A[i]; ans1%=K; } lint B[N]; rep(i,N){ cin>>B[i]; ans2+=B[i]; ans2%=K; } lint ans; if(s=='+'){ ans=ans1*N+ans2*Q; ans%=K; cout<