#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <numeric>
#include <queue>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll n,m; cin >> n >> m;
	ll k; cin >> k;
	char c; cin >> c;
	vector<ll> b(m),a(n);
	ll sum=0;
	ll sum2=0;
	for(int i=0;i<m;i++){
		cin >> b[i];
		sum+=b[i];
	}
	for(int i=0;i<n;i++){
		cin >> a[i];
		sum2+=a[i];
	}
	sum2%=k;
	sum%=k;
	if(c=='+'){
		cout << (sum%k*n%k+sum2%k*m%k)%k << endl;
	}
	else{
		ll ans=0;
		for(int i=0;i<n;i++){
			ans+=a[i]*sum%k;
			ans%=k;
		}
		cout << ans << endl;
	}
}