#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
vector<pair<T, int> > prime_factorization(T val) {
  vector<pair<T, int> > res;
  for (T i = 2; i * i <= val; ++i) {
    if (val % i != 0) continue;
    int exponent = 0;
    while (val % i == 0) {
      ++exponent;
      val /= i;
    }
    res.emplace_back(i, exponent);
  }
  if (val != 1) res.emplace_back(val, 1);
  return res;
}

int main() {
  int n, m, k; char op; cin >> n >> m >> k >> op;
  vector<int> b(m); REP(i, m) cin >> b[i];
  vector<int> a(n); REP(i, n) cin >> a[i];
  ll ans = 0;
  if (op == '+') {
    map<int, int> mp;
    REP(i, m) ++mp[b[i] % k];
    REP(i, n) ans += mp[(k - a[i] % k) % k];
  } else if (op == '*') {
    if (k == 1) {
      cout << 1LL * n * m << '\n';
      return 0;
    }
    auto pri = prime_factorization(k);
    int sz = pri.size();
    const int N = 100000;
    vector<vector<bitset<N> > > cnt(sz);
    REP(i, sz) {
      int val, ex; tie(val, ex) = pri[i];
      cnt[i].resize(ex);
      REP(j, n) {
        int tmp = 0;
        while (tmp < ex && b[j] % val == 0) {
          ++tmp;
          b[j] /= val;
        }
        if (tmp > 0) cnt[i][tmp - 1].set(j);
      }
      for (int j = ex - 2; j >= 0; --j) cnt[i][j] |= cnt[i][j + 1];
    }
    bitset<N> base(0);
    REP(i, m) base.set(i);
    REP(i, n) {
      bitset<N> now = base;
      REP(j, sz) {
        int val, ex; tie(val, ex) = pri[j];
        int tmp = 0;
        while (tmp < ex && a[i] % val == 0) {
          ++tmp;
          a[i] /= val;
        }
        tmp = ex - tmp;
        if (tmp > 0) now &= cnt[j][tmp - 1];
      }
      ans += now.count();
    }
  }
  cout << ans << '\n';
  return 0;
}