#include <array>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;

int parsing(const string& s) {
	int pos = 0;
	auto expr0 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		/*
		if (s[pos] == '0') {
			pos++;
			return 0;
		}
		if (s[pos] == '1') {
			pos++;
			return 1;
		}
		*/
		return expr5(expr0, expr1, expr2, expr3, expr4, expr5);
	};
	auto expr1 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		int res = expr5(expr0, expr1, expr2, expr3, expr4, expr5);
		while (pos != int(s.size()) && s[pos] == '=') {
			pos++;
			int subres = expr5(expr0, expr1, expr2, expr3, expr4, expr5);
			res ^= subres ^ 1;
		}
		return res;
	};
	auto expr2 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		int res = expr1(expr0, expr1, expr2, expr3, expr4, expr5);
		while (pos != int(s.size()) && s[pos] == '&') {
			pos++;
			int subres = expr1(expr0, expr1, expr2, expr3, expr4, expr5);
			res &= subres;
		}
		return res;
	};
	auto expr3 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		int res = expr2(expr0, expr1, expr2, expr3, expr4, expr5);
		while (pos != int(s.size()) && s[pos] == '|') {
			pos++;
			int subres = expr2(expr0, expr1, expr2, expr3, expr4, expr5);
			res |= subres;
		}
		return res;
	};
	auto expr4 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		int res = expr3(expr0, expr1, expr2, expr3, expr4, expr5);
		while (pos != int(s.size()) && s[pos] == '^') {
			pos++;
			int subres = expr3(expr0, expr1, expr2, expr3, expr4, expr5);
			res ^= subres;
		}
		return res;
	};
	auto expr5 = [&](auto& expr0, auto& expr1, auto& expr2, auto& expr3, auto& expr4, auto& expr5) -> int {
		if (s[pos] == '0') {
			pos++;
			return 0;
		}
		if (s[pos] == '1') {
			pos++;
			return 1;
		}
		if (s[pos] == '(') {
			pos++;
			int subres = expr4(expr0, expr1, expr2, expr3, expr4, expr5);
			pos++;
			return subres;
		}
		if (s[pos] == '!') {
			pos++;
			int subres = expr5(expr0, expr1, expr2, expr3, expr4, expr5);
			return 1 - subres;
		}
		int res = expr5(expr0, expr1, expr2, expr3, expr4, expr5);
		return res;
	};
	int ans = expr4(expr0, expr1, expr2, expr3, expr4, expr5);
	return ans;
}

int main() {
	// step #1. input
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int N, K;
	cin >> N >> K;
	vector<vector<vector<bool> > > finished(K, vector<vector<bool> >(K, vector<bool>(4, false)));
	vector<array<int, 4> > seq;
	for (int i = 0; i < N; i++) {
		int a, b, c; string S;
		cin >> a >> b >> S >> c;
		a--; b--;
		vector<int> ends;
		for (char x = '0'; x <= '1'; x++) {
			for (int y = '0'; y <= '1'; y++) {
				string T = S;
				for (int i = 0; i < int(S.size()); i++) {
					if (S[i] == 'x') {
						T[i] = x;
					}
					if (S[i] == 'y') {
						T[i] = y;
					}
				}
				int res = parsing(T);
				if (res == 1) {
					ends.push_back(int(x == '1') + int(y == '1') * 2);
				}
			}
		}
		for (int i : ends) {
			if (!finished[a][b][i]) {
				finished[a][b][i] = true;
				seq.push_back({a, b, i, c});
			}
		}
	}
	int FINAL_VAL;
	cin >> FINAL_VAL;
	vector<vector<int> > g(1 << K, vector<int>(1 << K, -1));
	for (array<int, 4> v : seq) {
		for (int i = 0; i < (1 << K); i++) {
			for (int j = 0; j < (1 << K); j++) {
				if (g[i][j] == -1 && (((i >> v[0]) & 1) | (((j >> v[1]) & 1) << 1)) == v[2]) {
					g[i][j] = v[3];
				}
			}
		}
	}
	for (int i = 0; i < (1 << K); i++) {
		for (int j = 0; j < (1 << K); j++) {
			if (g[i][j] == -1) {
				g[i][j] = FINAL_VAL;
			}
		}
	}
	int ans1 = 0, ans2 = 0, ans3 = 0;
	for (int i = 0; i < (1 << K); i++) {
		ans1 += int(g[i][i] == 1);
	}
	ans2 += ans1;
	for (int i = 0; i < (1 << K); i++) {
		for (int j = i + 1; j < (1 << K); j++) {
			ans2 += int(g[i][j] + g[j][i] == 2) * 2;
		}
	}
	for (int i = 0; i < (1 << K); i++) {
		for (int j = 0; j < (1 << K); j++) {
			for (int k = 0; k < (1 << K); k++) {
				ans3 += int(g[i][j] == 1 && g[j][k] == 1 && g[i][k] == 0);
			}
		}
	}
	cout << ans1 << ' ' << ans2 << ' ' << ans3 << endl;
	return 0;
}