#include <bits/stdc++.h>
using namespace std;
inline void cmin(int &x, int y) { if (y < x) x = y; }
map<char, int> p;
void prepare() {
	p[')'] = -2;
	p['('] = -1;
	p['^'] = 0;
	p['|'] = 1;
	p['&'] = 2;
	p['='] = 3;
	p['!'] = 4;
}
int calc(int a, int b, int op) {
	if (op == 0) return a ^ b;
	if (op == 1) return a | b;
	if (op == 2) return a & b;
	if (op == 3) return a == b;
	assert(false);
}
int calc(string expr, char x, char y) {
	replace(expr.begin(), expr.end(), 'x', x);
	replace(expr.begin(), expr.end(), 'y', y);
	vector<int> z, o;
	auto Pop = [&]() {
		if (o.back() == '!') z.back() ^= 1;
		else *prev(z.end(), 2) = calc(z.back(), *prev(z.end(), 2), p[o.back()]), z.pop_back();
		o.pop_back();
	};
	for (int _ = (int) expr.size() - 1; _ >= 0; _--) {
		char s = expr[_];
		if (isdigit(s)) z.push_back(s - '0');
		else if (s == ')') o.push_back(')');
		else {
			while (o.size() && p[o.back()] >= p[s]) {
				Pop();
			}
			if (s == '(') assert(o.back() == ')'), o.pop_back();
			else o.push_back(s);
		}
	}
	while (o.size()) {
		Pop();
	}
	return z.back();
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	prepare();
	int n, k;
	cin >> n >> k;
	vector<int> rez(n + 1);
	vector f(k, vector(2, vector(k, vector(2, n))));
	for (int i = 0; i < n; i++) {
		int u, v;
		string expr;
		cin >> u >> v >> expr >> rez[i], u--, v--;
		for (int x : {0, 1}) {
			for (int y : {0, 1}) {
				if (calc(expr, x + '0', y + '0')) {
					cmin(f[u][x][v][y], i);
				}
			}
		}
	}
	cin >> rez[n];
	vector<bitset<1024>> g(1 << k), og(1 << k);
	vector e(1 << k, vector<bool>(1 << k));
	for (int S = 0; S < (1 << k); S++) {
		for (int T = 0; T < (1 << k); T++) {
			int pos = n;
			for (int i = 0; i < k; i++) {
				for (int j = 0; j < k; j++) {
					pos = min(pos, f[i][S >> i & 1][j][T >> j & 1]);
				}
			}
			if (rez[pos]) e[S][T] = 1, g[S].set(T);
			else og[S].set(T);
		}
	}
	int r1 = 0, r2 = 0, r3 = 0;
	for (int x = 0; x < (1 << k); x++) {
		r1 += e[x][x];
		for (int y = 0; y < (1 << k); y++) {
			r2 += e[x][y] && e[y][x];
			if (e[x][y]) r3 += (g[y] & og[x]).count();
		}
	}
	cout << r1 << " " << r2 << " " << r3 << "\n";
	return 0;
}