import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }

long[2][] primeFact(long x)
{
	long[2][] ans;
	for (long i = 2; i*i <= x; ++i)
	{
		if (x % i != 0) continue;

		long r;
		while (x % i == 0)
		{
			++r;
			x /= i;
		}
		ans ~= [i, r];
	}
	if (x != 1)
		ans ~= [x, 1];
	return ans;
}

void main()
{
	auto N = RD;
	auto M = RD;
	auto K = RD;
	auto op = RD!string;
	auto B = new long[](M);
	auto A = new long[](N);
	foreach (i; 0..M)
		B[i] = RD;
	foreach (i; 0..N)
		A[i] = RD;

	long ans;
	if (op[0] == '+')
	{
		long[long] set;
		foreach (i; 0..M)
		{
			++set[B[i] % K];
		}
		foreach (i; 0..N)
		{
			auto x = K - A[i] % K;
			ans += set.get(x, 0);
		}
	}
	else
	{
		auto fact = primeFact(K);
		fact.sort!"a[0] > b[0]"();
		long[long] set;
		foreach (i; 0..N)
		{
			bool ok;
			long x = 1;
			if (A[i] == K)
			{
				++set[1];
				continue;
			}
			foreach (e; fact)
			{
				auto y = e[0]^^e[1];
				if (ok)
					x *= y;
				else
				{
					if (y % A[i] == 0)
					{
						ok = true;
						x *= y / A[i];
					}
					else if (A[i] % e[0] == 0)
					{
						ok = true;
						x *= y / e[0];
					}
					else
						x *= y;
				}
			}
			++set[x];
		}
		foreach (key; set.keys)
		{
			foreach (i; 0..M)
			{
				if (B[i] % key == 0)
				{
					ans += set[key];
					debug writeln("key:", key, " B[", i, "]:", B[i]);
				}
				else if (B[i] % K == 0)
				{
					ans += set[key];
				}
			}
		}
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}