#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}


int main(){
  ll N, M, K; cin >> N >> M >> K;
  char op; cin >> op;
  vector<ll> A(N);
  vector<ll> B(M);
  rep(i,M) cin >> B[i];
  rep(i,N) cin >> A[i];
  ll ans = 0;
  if(op == '+'){
    ll a=0, b=0;
    rep(i,N){
      a += A[i];
      a %= K;
    }
    rep(i,M){
      b += B[i];
      b %= K;
    }
    ans = (a*M+b*N)%K;
  }
  else if(op == '*'){
    ll a=0, b=0;
    rep(i,N){
      a += A[i];
      a %= K;
    }
    rep(i,M){
      ans += a*B[i];
      ans %= K;
    }
  }
  cout << ans << endl;
  return 0;
}