#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, m, k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<ll> a(n), b(m);
  rep(i,m) cin >> b[i];
  rep(i,n) cin >> a[i];
  ll sum = 0;
  for (int i = 0; i < m; i++) {
    sum += b[i];
    sum %= k;
  } 
  ll res = 0;
  for (int i = 0; i < n; i++) (res += (op == '+' ? a[i] * m + sum : a[i] * sum)) %= k;
  cout << res << endl;
  return 0;
}