#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
 
ll MOD = 1000000007;
ll INF =1<<30;
ll dp[110][100100];

int main(){
   int n,m,k;
   cin >> n >> m >> k;
   char op;cin >>op;
   vector<int> b(m);
   rep(i,m)cin >> b[i];
   vector<int>a(n);
   rep(i,n)cin >> a[i];
   if(op=='+'){
      ll tota=0,totb=0;
      rep(i,n) tota+=a[i];
      rep(i,m) totb+=b[i];
      tota*=m;
      totb*=n;
      cout << (tota+totb)%k <<endl;
   }
   else{
      ll tota=0,totb=0;
      rep(i,n) tota+=a[i];
      rep(i,m) totb+=b[i];
      tota%=k;
      totb%=k;
      cout <<(tota*totb)%k <<endl;
   }
}