#ifdef LOCAL
#define _GLIBCXX_DEBUG 1
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

#if 0
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
 
    template<class T>
    using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, std::less<T>, __gnu_pbds::rb_tree_tag,
        __gnu_pbds::tree_order_statistics_node_update>;
#endif

#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <queue>
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <ctime> 
#include <cstring>
#include <random>
#include <chrono>
#include <cassert>

using namespace std;
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)

#define each(a,x) for (auto& a: x)
#define tcT template<class T
#define tcTU tcT, class U
#define tcTUU tcT, class ...U
template<class T> using V = vector<T>; 
template<class T, size_t SZ> using AR = array<T,SZ>;

typedef string str;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
 
template<typename T, typename U> T &ctmax(T &x, const U &y){ return x = max<T>(x, y); }
template<typename T, typename U> T &ctmin(T &x, const U &y){ return x = min<T>(x, y); }
 
mt19937 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());
 
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(vector<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { bool fst = 1; str res = "{"; for (const auto& x: v) {if (!fst) res += ", ";	fst = 0; res += ts(x);}	res += "}"; return res;}
template<class A, class B> str ts(pair<A,B> p) {return "("+ts(p.first)+", "+ts(p.second)+")"; }
 
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); }
void ps() { pr("\n"); }
template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {cerr << ts(h); if (sizeof...(t)) cerr << ", ";	DBG(t...); }

tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(double& d) { str t; re(t); d = stod(t); }
void re(long double& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcTU> void re(pair<T,U>& p) { re(p.first,p.second); }
tcT> void re(V<T>& x) { each(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { each(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }

constexpr bool multitest() {return 0;}
void solve();
int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int t = 1;
	if (multitest()) cin >> t;
	for (; t; t--) solve();
}






















int comp[11][11][11][11];
int ret[1024][1024];
bitset<1024> fr[1024];
bitset<1024> to[1024];

int pred[128];
int is_num[128];

int eval(vector<char>& expr, int x, int y) {
	vector<int> vals;
	for (char c : expr) {
		if (c == '1') vals.push_back(1);
		else if (c == '0') vals.push_back(0);
		else if (c == 'x') vals.push_back(x);
		else if (c == 'y') vals.push_back(y);
		else if (c == '!') {
			int r = vals.back();
			vals.pop_back();
			vals.push_back(!r);
		}
		else {
			int a = vals.back();
			vals.pop_back();
			int b = vals.back();
			vals.pop_back();

			if (c == '|') vals.push_back(a|b);
			else if (c == '^') vals.push_back(a^b);
			else if (c == '=') vals.push_back(a==b);
			else if (c == '&') vals.push_back(a&b);
		}
	}

	return vals.back();
}

void solve() {
	int n, k; re(n, k);

	memset(ret,-1,sizeof(ret));
	memset(pred,-1,sizeof(pred));
	pred['^'] = 1;
	pred['|'] = 2;
	pred['&'] = 3;
	pred['='] = 4;

	for (char c: "01xy") is_num[c]=1;

	for (int _ = 0; _ < n; _++) {
		int a, b; re(a, b); a--; b--;

		string s; re(s);
		s = '(' + s + ')';
		int v; re(v);

		vector<char> out;
		vector<char> op;

		for (int j = 0; j < sz(s); j++) {
			if (is_num[s[j]]) {
				out.push_back(s[j]);
				while (!op.empty() && op.back() == '!') {
					out.push_back(op.back());
					op.pop_back();
				}
			}
			else if (s[j] == '!') {
				op.push_back(s[j]);
			}
			else if (s[j] == '(') {
				op.push_back(s[j]);
			}
			else if (s[j] == ')') {
				while (op.back() != '(') {
					out.push_back(op.back());
					op.pop_back();
				}
				op.pop_back();
				while (!op.empty() && op.back() == '!') {
					out.push_back(op.back());
					op.pop_back();
				}
			}
			else {
				while (!op.empty() && pred[op.back()] >= pred[s[j]]) {
					out.push_back(op.back());
					op.pop_back();
				}
				op.push_back(s[j]);
			}
		}

		for (int x = 0; x < 2; x++) {
			for (int y = 0; y < 2; y++) {
				if (eval(out, x, y)) {
					if (!comp[a][b][x][y]) {
						comp[a][b][x][y] = 1;
						for (int le = 0; le < (1<<k); le++) if ( (le>>a&1) == x ){
							for (int ri = 0; ri < (1<<k); ri++) if ( (ri>>b&1) == y ) {
								//if (le == 1 && ri == 1) dbg(_, x,y,le, ri);
								if (ret[le][ri] == -1) ret[le][ri] = v;
							}
						}
					}
				}
			}
		}
	}

	/*for (int le = 0; le < (1<<k); le++) {
		for (int ri = 0; ri < (1<<k); ri++) {
			dbg(le, ri, ret[le][ri]);
		}
	}*/

	int v; re(v);
	for (int le = 0; le < (1<<k); le++) {
		for (int ri = 0; ri < (1<<k); ri++) {
			if (ret[le][ri] == -1) ret[le][ri] = v;
		}
	}

	int ref = 0;
	for (int i = 0; i < (1<<k); i++) if (ret[i][i]) ref++;

	int sym = 0;
	for (int le = 0; le < (1<<k); le++) {
		for (int ri = 0; ri < (1<<k); ri++) {
			if (ret[le][ri] && ret[ri][le]) sym++;
		}
	}

	for (int i = 0; i < (1<<k); i++) {
		for (int j = 0; j < (1<<k); j++) {
			fr[j][i] = ret[i][j];
		}
	}

	for (int i = 0; i < (1<<k); i++) to[i] = ~fr[i];

	int tr = 0;
	for (int i = 0; i < (1<<k); i++) {
		for (int j = 0; j < (1<<k); j++) {
			if (ret[i][j]) {
				tr += (fr[i] & to[j]).count();
			}
		}
	}
	ps(ref, sym, tr);
}