//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn run() {
    input! {
        m: usize,
        n: usize,
        gx: (usize, usize),
        gy: (usize, usize),
        bit: usize,
        x: [usize; m],
        y: [usize; m],
        a: [usize; m],
        b: [usize; m],
    }
    let mut z = vec![0usize; bit];
    for (x, y) in x.iter().zip(y.iter()) {
        z[*x] += *y;
    }
    let mut nx = x[m - 1];
    let mut ny = y[m - 1];
    for _ in (m + 1)..=n {
        nx = (nx * gx.0 + gx.1) & (bit - 1);
        ny = (ny * gy.0 + gy.1) & (bit - 1);
        z[nx] += ny;
    }
    for i in 1..bit {
        let mut j = 2 * i;
        while j < bit {
            z[i] += z[j];
            j += i;
        }
    }
    let mut xor = 0;
    for (a, b) in a.iter().zip(b.iter()) {
        let mut ans = 0;
        if *a < bit {
            ans += z[*a];
        }
        if *a * *b < bit {
            ans -= z[*a * *b];
        }
        println!("{}", ans);
        xor ^= ans;
    }
    let mut na = a[m - 1];
    let mut nb = b[m - 1];
    for _ in (m + 1)..=n {
        na = ((na * gx.0 + gx.1 + bit - 1) & (bit - 1)) + 1;
        nb = ((nb * gy.0 + gy.1 + bit - 1) & (bit - 1)) + 1;
        let mut ans = 0;
        if na < bit {
            ans += z[na];
        }
        if na * nb < bit {
            ans -= z[na * nb];
        }
        xor ^= ans;
    }
    println!("{}", xor);
}

fn main() {
    run();
}