#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

ll n, m, k;
void solve_add(){
  vll a(n), b(m);
  re(i, m) std::cin >> b[i];
  re(i, n) std::cin >> a[i];
  sort(all(a));
  ll ans = 0;
  for(int i=0;i<m;i++){
    ll target = (k - b[i])%k;
    ll l = upper_bound(all(a), target) - a.begin();
    ll r = upper_bound(all(a), target+1) - a.begin();
    ans += r - l;
  }
  std::cout << ans << '\n';
}


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

void solve_mul(){
  vll a(n), b(m);
  re(i, m) std::cin >> b[i];
  re(i, n) std::cin >> a[i];

  vll d;//kの約数
  d.push_back(1);
  d.push_back(k);

  for(ll i=2;i*i<=k;i++){
    if(k%i==0){
      d.push_back(i);
      if(i*i!=k) d.push_back(k/i);
    }
  }
  vll cnt(d.size(), 0);
  for(int i=0;i<n;i++) for(int j=0;j<d.size();j++) if(a[i]%d[j]==0) cnt[j]++;
  map<ll, ll> mp;
  for(int i=0;i<d.size();i++){
    mp.emplace(d[i], i);
  }
  ll ans = 0;
  for(int i=0;i<m;i++){
    ll g = gcd(k, b[i]);
    ll need_idx = mp[k/g];
    ans += cnt[need_idx];
  }
  std::cout << ans << '\n';
}

int main(){
  std::cin >> n >> m >> k;
  char op;std::cin >> op;
  if(op=='+') solve_add();
  else solve_mul();
}