#include //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; //typedef long long ll; typedef int ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple tl; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; //ll inf=1LL<<60; long double pi=3.14159265358979323846L; double eps=1e-12; #define rep(i,m,n) for(ll i=m;i=m;i--) #define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll gcd(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll beki(ll n,ll k,ll md){ ll ret=1; ll now=n; while(k>0){ if(k%2==1){ ret*=now; ret%=md; } now*=now; now%=md; k/=2; } return ret; } ll gyaku(ll n,ll md){ return beki(n,md-2,md); } int main(){ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); ll n,m,k;cin>>n>>m>>k; char o;cin>>o; ll b[m]; ll a[n]; vector v; for(ll i=1;i*i<=k;i++){ if(k%i==0){ v.push_back(i); if(i*i mp; unordered_map yaku; //rep(i,0,v.size())cout<>b[i]; mp[b[i]%k]++; rep(j,0,v.size()){ if(b[i]%v[j]==0)yaku[v[j]]++; } } long long ans=0; rep(i,0,n){ cin>>a[i]; if(o=='+'){ a[i]%=k; a[i]=k-a[i]; if(a[i]==k)a[i]=0; ans+=mp[a[i]]; } else{ ll c=gcd(k,a[i]); ll t=k/c; //cout<