#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
//template end



int main(){
   int n,m,k; scanf("%d%d%d",&n,&m,&k);
   char c; cin>>c;
   vector<int> a(n),b(m);
   rep(i,0,m)scanf("%d",&b[i]);
   rep(i,0,n)scanf("%d",&a[i]);
   ll res=0;
   if(c=='+'){
      map<int,int> mp;
      rep(i,0,m)mp[b[i]%k]++;
      rep(i,0,n)res+=mp[(k-a[i]%k)%k];
   }
   else{
      map<int,int> cnta,cntb;
      rep(i,0,m)cntb[__gcd(b[i],k)]++;
      rep(i,0,n)cnta[__gcd(a[i],k)]++;
      for(auto p:cnta)for(auto q:cntb)if(p.first*q.first%k==0)res+=1LL*p.second*q.second;
   } printf("%lld\n",res);
   return 0;
}