use std::collections::{HashMap, BTreeMap};


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(|v| v.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 result = a.iter().map(|&v| *bmap.get(&((k-v%k)%k)).unwrap_or(&0usize)).sum::<usize>();
        println!("{}", result);
        return;
    }
    let mut primemap = BTreeMap::new();
    let mut target = k;
    for i in 2..=(k as f64).sqrt().floor() as usize {
        while target % i == 0 {
            *primemap.entry(i).or_insert(0usize) += 1;
            target /= i;
        }
    }
    if target > 1 {
        primemap.insert(target, 1);
    }
    let primemap = primemap.into_iter().collect::<Vec<_>>();
    let mut bmap = HashMap::new();
    for &v in b.iter() {
        let mut target = v;
        let mut key = 1usize;
        for &(val, limit) in primemap.iter() {
            let mut cnt = 0usize;
            while target % val == 0 {
                target /= val;
                cnt += 1;
            }
            key *= val.pow(cnt.min(limit) as u32);
        }
        *bmap.entry(key).or_insert(0usize) += 1;
    }
    let mut result = 0usize;
    for &v in a.iter() {
        for (&bkey, &bcnt) in bmap.iter() {
            if bkey * v % k == 0 {
                result += bcnt;
            }
        }
    }
    println!("{}", result);
}