#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) for (auto&& itr : x) { cerr << (itr) << " "; }

template <class T> inline void chmax(T &ans, T t) { if (t > ans) ans = t;}
template <class T> inline void chmin(T &ans, T t) { if (t < ans) ans = t;}

// 最大公約数を求める(ユークリッドの互除法).
long long gcd (long long x, long long y) {
  if (y > x) swap(x,y);
  if (y == 0) return x;
  return gcd(x%y,y);
}

int main() {
  int n,m,k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<int> a(n), b(m);
  map<int, int> mp;
  rep(i, m) {
    cin >> b[i];
    mp[b[i] % k] += 1;
  }
  rep(i, n) {
    cin >> a[i];
  }

  ll ans = 0;
  if (op == '+') {
    for (auto itr : a) {
      auto md = (-itr) % k;
      if (md < 0) md += k;
      ans += mp[md];
    }
  } else {
    map<ll, ll> am, bm;
    for (auto itr : a) {
      am[gcd(itr, k)] += 1;
    }

    for (auto itr : b) {
      bm[gcd(itr, k)] += 1;
    }

    for (auto itr : am) {
      for (auto itr2 : bm) {
        if ((itr.first * itr2.first) % k == 0) {
          ans += itr.second * itr2.second;
        }
      }
    }
  }

  cout << ans << endl;
}