#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,K;
char op;
int A[SIZE], B[SIZE];
map<int, int> C, D;

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

int count_add() {
    REP(i,M) {
        C[B[i]%K]++;
    }
    int ans = 0;
    REP(i,N) {
        int m = K - (A[i]%K);
        if (m==K) m = 0;
        ans += C[m];
    }
    return ans;
}

int count_mul() {
    REP(i,M) {
        C[gcd(K, B[i])]++;
    }
    REP(i,N) {
        D[gcd(K, A[i])]++;
    }
    int ans = 0;
    for (auto c:C) for (auto d:D) {
        if ((c.first * d.first) % K == 0) {
            ans += c.second * d.second;
        }
    }
    return ans;
}

void solve() {
    cin>>N>>M>>K>>op;
    REP(i,M)cin>>B[i];
    REP(i,N)cin>>A[i];
    
    if (op=='+') {
        cout << count_add() << endl;
    } else {
        cout << count_mul() << endl;
    }
}