use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        n: usize,
        k: usize,
        cond: [(usize1, usize1, bytes, u8); n],
        fix: u8,
    }
    let mut used = [[[[false; 2]; 2]; 10]; 10];
    let mut memo = vec![];
    for (a, b, s, r) in cond {
        let mut solver = Parser {
            s: s,
            po: 0,
        };
        let mat = solver.xor();
        for i in 0..2 {
            for j in 0..2 {
                if !used[a][b][i][j] && mat[i][j] == 1 {
                    used[a][b][i][j] = true;
                    memo.push((a, b, i, j, r));
                }
            }
        }
    }
    let eval = |x: usize, y: usize| -> u8 {
        for &(a, b, p, q, r) in memo.iter() {
            if x >> a & 1 == p && y >> b & 1 == q {
                return r;
            }
        }
        fix
    };
    let w = 8 * std::mem::size_of::<usize>();
    let len = ((1 << k) + w - 1) / 2;
    let mut func = vec![vec![0; len]; 1 << k];
    for (i, f) in func.iter_mut().enumerate() {
        for j in 0..(1 << k) {
            let q = j / w;
            let r = j % w;
            f[q] |= (eval(i, j) as usize) << r;
        }
    }
    let at = |f: &[usize], x: usize| -> bool {
        let q = x / w;
        let r = x % w;
        f[q] >> r & 1 == 1
    };
    let find = |x: usize, y: usize| -> bool {
        at(&func[x], y)
    };
    let mut rev = vec![vec![0; len]; 1 << k];
    for i in 0..(1 << k) {
        for j in 0..(1 << k) {
            let q = j / w;
            let r = j % w;
            rev[i][q] |= (find(j, i) as usize) << r;
        }
    }
    let mut ans = (0, 0, 0);
    for i in 0..(1 << k) {
        if find(i, i) {
            ans.0 += 1;
        }
        for j in 0..(1 << k) {
            if find(i, j) && find(j, i) {
                ans.1 += 1;
            }
            if !find(i, j) {
                ans.2 += func[i].iter().zip(rev[j].iter()).fold(0, |s, a| s + (*a.0 & *a.1).count_ones());
            }
        }
    }
    println!("{} {} {}", ans.0, ans.1, ans.2);
}

#[derive(Debug)]
struct Parser {
    s: Vec<u8>,
    po: usize,
}

// [x][y] = res
impl Parser {
    fn peek(&self) -> Option<u8> {
        self.s.get(self.po).cloned()
    }
    fn eat(&mut self) -> u8 {
        let c = self.peek().unwrap();
        self.po += 1;
        c
    }
    fn xor(&mut self) -> [[u8; 2]; 2] {
        let mut l = self.or();
        while self.peek().map_or(false, |c| c == b'^') {
            self.eat();
            let r = self.or();
            for (l, r) in l.iter_mut().zip(r.iter()) {
                for (l, r) in l.iter_mut().zip(r.iter()) {
                    *l ^= *r;
                }
            }
        }
        l
    }
    fn or(&mut self) -> [[u8; 2]; 2] {
        let mut l = self.and();
        while self.peek().map_or(false, |c| c == b'|') {
            self.eat();
            let r = self.and();
            for (l, r) in l.iter_mut().zip(r.iter()) {
                for (l, r) in l.iter_mut().zip(r.iter()) {
                    *l |= *r;
                }
            }
        }
        l
    }
    fn and(&mut self) -> [[u8; 2]; 2] {
        let mut l = self.eq();
        while self.peek().map_or(false, |c| c == b'&') {
            self.eat();
            let r = self.eq();
            for (l, r) in l.iter_mut().zip(r.iter()) {
                for (l, r) in l.iter_mut().zip(r.iter()) {
                    *l &= *r;
                }
            }
        }
        l
    }
    fn eq(&mut self) -> [[u8; 2]; 2] {
        let mut l = self.not();
        while self.peek().map_or(false, |c| c == b'=') {
            self.eat();
            let r = self.not();
            for (l, r) in l.iter_mut().zip(r.iter()) {
                for (l, r) in l.iter_mut().zip(r.iter()) {
                    *l = (*l == *r) as u8;
                }
            }
        }
        l
    }
    fn not(&mut self) -> [[u8; 2]; 2] {
        if self.peek().unwrap() != b'!' {
            return self.term();
        }
        let mut sign = 0;
        if self.peek().unwrap() == b'!' {
            self.eat();
            sign = 1;
        }
        let mut res = self.not();
        for a in res.iter_mut().flatten() {
            *a ^= sign;
        }
        res
    }
    fn term(&mut self) -> [[u8; 2]; 2] {
        let c = self.eat();
        if c == b'0' {
            [[0; 2]; 2]
        } else if c == b'1' {
            [[1; 2]; 2]
        } else if c == b'x' {
            [[0; 2], [1; 2]]
        } else if c == b'y' {
            [[0, 1]; 2]
        } else {
            assert!(c == b'(', "{}", c as char);
            let res = self.xor();
            let d = self.eat();
            assert!(d == b')', "{}", d as char);
            res
        }
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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_export]
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_export]
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, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------