#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int gcd(int a,int b){
  if(a<b) swap(a,b);
  if(b==0) return a;
  return gcd(b,a%b);
}

template<typename T>
vector<T> divisor_list(T x){
    vector<T> res;
    for(T i=1;i*i<=x;i++){
        if (x%i==0) {
            res.push_back(i);
            if (i*i!=x) res.push_back(x/i);
        }
    }
    return res;
}

int n,m,k;
string op;
vector<ll> a,b;

void solve(){
  cin >> n >> m >> k;
  cin >> op;
  a.resize(n,0);b.resize(m,0);
  rep(i,m){
    cin >> b[i];
  }
  rep(j,n){
    cin >> a[j];
  }
  if(op=="+"){
    ll ans=0;
    map<int,ll> ma={};
    rep(i,m){
      ma[b[i]%k]+=1;
    }
    rep(i,n){
      if(a[i]%k) ans+=ma[k-(a[i]%k)];
      else ans+=ma[0];
    }
    cout << ans << endl;
  }
  else{
    ll ans=0;
    vector<int> div=divisor_list(k);
    map<int,ll> ma={};
    for(int d:div){
      rep(i,m){
        if(b[i]%d==0) ma[d]+=1;
      }
    }
    rep(i,n){
      //cout << gcd(k,a[i]) << endl;
      ans+=ma[k/gcd(k,a[i])];
    }
    cout << ans << endl;
  }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}