package main import ( "bufio" "fmt" "os" "strconv" ) func configure(scanner *bufio.Scanner) { scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) } func getNextString(scanner *bufio.Scanner) string { scanned := scanner.Scan() if !scanned { panic("scan failed") } return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout extra := 0 if os.Getenv("I") == "IronMan" { fp, _ = os.Open(os.Getenv("END_GAME")) extra = 100 } scanner := bufio.NewScanner(fp) configure(scanner) writer := bufio.NewWriter(wfp) defer func() { r := recover() if r != nil { fmt.Fprintln(writer, r) } writer.Flush() }() solve(scanner, writer) for i := 0; i < extra; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) m := getNextInt(scanner) k := getNextInt(scanner) aa := make([]int, n) bb := make([]int, m) ca := make([]mint, 1024) cb := make([]mint, 1024) ca[0] = 1 cb[0] = 1 cca := make([]mint, 1024) ccb := make([]mint, 1024) a := 0 b := 0 for i := 0; i < n; i++ { aa[i] = getNextInt(scanner) a = a ^ aa[i] ca[a]++ } for i := 0; i < 1024; i++ { for j := 0; j < 1024; j++ { if i == j { cca[i^j].addAs(ca[i].sub(1).mul(ca[j])) continue } cca[i^j].addAs(ca[i].mul(ca[j])) } } for i := 0; i < m; i++ { bb[i] = getNextInt(scanner) b = b ^ bb[i] cb[b]++ } for i := 0; i < 1024; i++ { for j := 0; j < 1024; j++ { if i == j { ccb[i^j].addAs(cb[i].sub(1).mul(cb[j])) continue } ccb[i^j].addAs(cb[i].mul(cb[j])) } } var ans mint for i := 0; i < 1024; i++ { ans.addAs(cca[i].mul(ccb[i^k]).div(4)) } fmt.Fprintln(writer, ans) } type mint int64 func (mt mint) mod() mint { m := mint(1e9 + 7) mt %= m if mt < 0 { return mt + m } return mt } func (mt mint) inv() mint { return mt.pow(mint(0).sub(2)) } func (mt mint) pow(n mint) mint { p := mint(1) for n > 0 { if n&1 == 1 { p.mulAs(mt) } mt.mulAs(mt) n >>= 1 } return p } func (mt mint) add(x mint) mint { return (mt + x).mod() } func (mt mint) sub(x mint) mint { return (mt - x).mod() } func (mt mint) mul(x mint) mint { return (mt * x).mod() } func (mt mint) div(x mint) mint { return mt.mul(x.inv()) } func (mt *mint) addAs(x mint) *mint { *mt = mt.add(x) return mt } func (mt *mint) subAs(x mint) *mint { *mt = mt.sub(x) return mt } func (mt *mint) mulAs(x mint) *mint { *mt = mt.mul(x) return mt } func (mt *mint) divAs(x mint) *mint { *mt = mt.div(x) return mt }