#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
const int mod = 1000000007;
ll modpow(ll a, int b) { return b ? modpow(a * a % mod, b / 2) * (b % 2 ? a : 1) % mod : 1; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> inline void add(T &a, int b) { a += b; if (a >= mod) a -= mod; }



void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int T;
    // cin >> T;
    T = 1;

    while (T--) {
        solve();
    }
}

template<typename T>
map<T, int> prime_factorize(T n) {
    T tmp = n;
    map<T, int> mp;
    for (T i = 2; i * i <= n; ++i) {
        ll cnt = 0;
        while (tmp % i == 0) {
            tmp /= i;
            cnt++;
        }
        if (cnt) mp[i] += cnt;
    }
    if (tmp != 1) mp[tmp]++;
    return mp;
}

set<int> all_divisor_catch(int n) {
    set<int> s;
    for (int i = 1; i * i <= n; ++i) {
        if (n % i == 0) {
            s.insert(i);
            s.insert(n / i);
        }
    }
    return s;
}

void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<ll> b(m), a(n);
  rep(i, m) cin >> b[i];
  rep(i, n) cin >> a[i];

  if (op == '+') {
    ll ans = 0;
    map<int, int> mp;
    rep(i, m) mp[b[i] % k]++;
    rep(i, n) ans += mp[k - a[i] % k];
    cout << ans << endl;
  } else {
    ll ans = 0;
    // a[i] の相方を探す
    auto mpk = prime_factorize(k);
    map<int, int> mpv;
    rep(i, m) {
      auto mp = prime_factorize(b[i]);
      for (auto e : mp) {
        if (mpk.count(e.F)) chmin(mp[e.F], mpk[e.F]);
        else mp[e.F] = 0;
      }
      int x = 1;
      for (auto e : mp) {
        x *= pow(e.F, e.S);
      }
      auto v = all_divisor_catch(x);
      for (auto e : v) mpv[e]++;
    }
    // for (auto e : mpv) cout << e.F << " " << e.S << endl;
    rep(i, n) {
      auto mp = prime_factorize(a[i]);
      for (auto e : mp) {
        if (mpk.count(e.F)) chmin(mp[e.F], mpk[e.F]);
        else mp[e.F] = 0;
      }
      int x = 1;
      for (auto e : mp) {
        x *= pow(e.F, e.S);
      }
      // cout << x << endl;
      ans += mpv[k / x];
    }
    cout << ans << endl;
  }
}