#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<int> b(m);
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
  }
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int bsum = 0;
  for (int i = 0; i < m; ++i) {
    bsum += b[i];
    bsum %= k;
  }
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    int res = 0;
    if (op == '+') {
      res = (m * a[i]) % k;
      res = (res + bsum) % k;
    } else {
      res = a[i];
      res = (res * bsum) % k;
    }
    ans = (ans + res) % k;
  }
  cout << ans << endl;
  return 0;
}