#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

bool eval(string s)
{
	vector<int> st, V;
	for(auto c : s)
	{
		if(c == '0') V.push_back(0);
		else if(c == '1') V.push_back(1);
		else if(c == '(') st.push_back(-1);
		else if(c == ')')
		{
			while(st.back() != -1) V.push_back(st.back()), st.pop_back();
			st.pop_back();
		}
		else
		{
			int k;
			if(c == '^') k = 2;
			else if(c == '|') k = 3;
			else if(c == '&') k = 4;
			else if(c == '=') k = 5;
			else k = 6;
			while(st.size() && st.back() > k) V.push_back(st.back()), st.pop_back();
			st.push_back(k); 
		}
	}
	while(st.size()) V.push_back(st.back()), st.pop_back();

	// for(auto i : V) cout << i << ' '; cout << endl;

	vector<int> num;
	for(auto i : V)
	{
		if(i <= 1) num.push_back(i);
		else if(i == 2)
		{
			int x = num.back(); num.pop_back();
			int y = num.back(); num.pop_back();
			num.push_back(x ^ y);
		}
		else if(i == 3)
		{
			int x = num.back(); num.pop_back();
			int y = num.back(); num.pop_back();
			num.push_back(x | y);
		}
		else if(i == 4)
		{
			int x = num.back(); num.pop_back();
			int y = num.back(); num.pop_back();
			num.push_back(x & y);
		}
		else if(i == 5)
		{
			int x = num.back(); num.pop_back();
			int y = num.back(); num.pop_back();
			num.push_back(x == y);
		}
		else
		{
			int x = num.back(); num.pop_back();
			num.push_back(!x);
		}
	}
	assert(num.size() == 1);
	return num[0];
}

bool eval2(string S, int x, int y)
{
	for(int i=0; i<S.size(); i++)
	{
		if(S[i]=='x') S[i]='0'+x;
		if(S[i]=='y') S[i]='0'+y;
	}
	return eval(S);
}

int eval3(string S)
{
	int ret=0;
	ret|=(eval2(S, 0, 0)<<0);
	ret|=(eval2(S, 0, 1)<<1);
	ret|=(eval2(S, 1, 0)<<2);
	ret|=(eval2(S, 1, 1)<<3);
	return ret;
}

const int MAXN = 2e5;
const int MAXK = 10;

int N, K, R;

struct Data
{
	int x, y;
	int res;
	int r;
};
Data A[MAXN+10];
bool alive[MAXN+10];
vector<int> V[11][11], V2;
bool B[1100][1100];

typedef bitset<1100> BS;
BS B1[1100], B2[1100];

bool f(int x, int y)
{
	for(auto it : V2)
	{
		int p=0, q=0;
		if(x&(1<<A[it].x)) p=1;
		if(y&(1<<A[it].y)) q=1;
		int t=p*2+q;
		if(A[it].res&(1<<t)) return A[it].r;
	}
	return R;
}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	
	// cout << eval("!0^!!0");

	cin >> N >> K;
	for(int i=1; i<=N; i++)
	{
		string S;
		cin >> A[i].x >> A[i].y >> S >> A[i].r;
		A[i].x--; A[i].y--;
		A[i].res = eval3(S);
		V[A[i].x][A[i].y].push_back(i);
	}
	cin >> R;

	for(int i=0; i<K; i++) for(int j=0; j<K; j++)
	{
		int mask = 15;
		for(auto it : V[i][j])
		{
			if((mask & A[it].res) != 0)
			{
				mask &= (~A[it].res);
				alive[it]=1;
			}
		}
	}

	for(int i=1; i<=N; i++) if(alive[i]) V2.push_back(i);

	for(int i=0; i<(1<<K); i++) for(int j=0; j<(1<<K); j++) B[i][j]=f(i, j);

	int ans=0;
	for(int i=0; i<(1<<K); i++) if(B[i][i]!=0) ans++;
	cout << ans << " ";

	ans=0;
	for(int i=0; i<(1<<K); i++) for(int j=0; j<(1<<K); j++) if(B[i][j]==1 && B[j][i]==1) ans++;
	cout << ans << " ";

	ans=0;

	for(int i=0; i<(1<<K); i++) for(int j=0; j<(1<<K); j++)
	{
		B1[i][j]=B[i][j];
		B2[j][i]=B[i][j];
	}

	for(int i=0; i<(1<<K); i++) for(int j=0; j<(1<<K); j++)
	{
		if(B[i][j]==0)
		{
			ans+=(B1[i] & B2[j]).count();
		}
	}
	cout << ans << "\n";
}