#include //#include //#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout< a) { swap(a, b); } ll r = a%b; while (r != 0) { a = b; b = r; r = a%b; } return b; } ll lcm(ll a, ll b) { return (a / gcd(a, b))*b; } void solve2(int n, int m, int k, vi a, vi b) { vi yaku; for (ll x = 1; x * x <= k; x++) { if (k % x == 0) { yaku.push_back(x); int y = k / x; if (x != y) yaku.push_back(y); } } map mp; rep (i, m) { int x = b[i]; for (int p: yaku) { if (x % p == 0) mp[p]++; } } ll ans = 0; rep (i, n) { int g = gcd(k, a[i]); ans += mp[k / g]; } printf("%lld\n", ans); } signed main() { fio(); int n, m, k; scanf("%d %d %d\n", &n, &m, &k); //assert (k != 735134400); char op; scanf("%c ", &op); vi a(n), b(m); rep (i, m) scanf("%d", &b[i]); rep (i, n) scanf("%d", &a[i]); if (op == '+') solve1(n, m, k, a, b); else solve2(n, m, k, a, b); }