#define _USE_MATH_DEFINES #include 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 using posteriority_queue = priority_queue, greater >; 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 inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } template void unique(vector &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 vector > prime_factorization(T val) { vector > 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 b(m); REP(i, m) cin >> b[i]; vector a(n); REP(i, n) cin >> a[i]; ll ans = 0; if (op == '+') { map 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; } map A, B; REP(i, n) ++A[__gcd(a[i], k)]; REP(i, m) ++B[__gcd(b[i], k)]; for (auto pr_a : A) for (auto pr_b : B) { if (1LL * pr_a.first * pr_b.first % k == 0) ans += 1LL * pr_a.second * pr_b.second; } } cout << ans << '\n'; return 0; }