use std::collections::HashMap;

fn gcd(a: usize, b: usize) -> usize {
    if b == 0 { return a; }
    gcd(b, a%b)
}

fn main() {
    let mut nmk = String::new();
    std::io::stdin().read_line(&mut nmk).ok();
    let nmk: Vec<usize> = nmk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nmk[0];
    let m = nmk[1];
    let k = nmk[2];
    let mut temp = String::new();
    std::io::stdin().read_line(&mut temp).ok();
    let temp: Vec<&str> = temp.trim().split_whitespace().collect();
    let op = temp[0].chars().nth(0).unwrap();
    let b = temp.into_iter().skip(1).map(|s| s.parse::<usize>().unwrap()).collect::<Vec<_>>();
    let a = (0..n).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: usize = temp.trim().parse().unwrap();
            temp
        })
        .collect::<Vec<_>>();

    if op == '+' {
        let mut bmap = HashMap::new();
        for &v in b.iter() {
            *bmap.entry(v%k).or_insert(0usize) += 1;
        }
        let mut result = 0usize;
        for &v in a.iter() {
            result += *bmap.get(&((k-v%k)%k)).unwrap_or(&0usize);
        }
        println!("{}", result);
        return;
    }
    let mut amap = HashMap::new();
    let mut bmap = HashMap::new();
    for &v in a.iter() {
        *amap.entry(gcd(v, k)).or_insert(0usize) += 1;
    }
    for &v in b.iter() {
        *bmap.entry(gcd(v, k)).or_insert(0usize) += 1;
    }
    let mut result = 0usize;
    for (&akey, &acnt) in amap.iter() {
        for (&bkey, &bcnt) in bmap.iter() {
            if gcd(akey*bkey, k) == k {
                result += acnt * bcnt;
            }
        }
    }
    println!("{}", result);
}