#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=1000010,MOD=1e9+7,M=1<<10;
const char en='\n';
const ll LLINF=1ll<<60;

string st;
int pri[300],ps[N];
string priord="^|&=!";
vi poj[N][7];

int bef(int i,int j,int x)
{
	auto it=lower_bound(all(poj[i][j]),x);
	if (it==poj[i][j].begin()) return -1;
	--it;
	return *it;
}

int ev(int l,int r)
{
	if (l==r-1) return st[l]-'0';
	//cout<<"BEGIN "<<l<<' '<<r<<' '<<st
	for (int i=0;i<5;++i)
	{
		int po=bef(ps[l],i,r);
		if (po<l) continue;
		if (priord[i]=='!')
		{
			po=l;
			return !ev(l+1,r);
		}
		int x=ev(l,po),y=ev(po+1,r);
		if (priord[i]=='^') return x^y;
		if (priord[i]=='|') return x|y;
		if (priord[i]=='&') return x&y;
		if (priord[i]=='=') return x==y;
	}
	//cout<<l<<' '<<r<<endl;
	assert(st[l]=='(' && st[r-1]==')');
	return ev(l+1,r-1);
}

int eva(string s)
{
	ps[0]=0;
	for (int i=0;i<(int)s.size();++i) for (int j=0;j<(int)priord.size();++j) poj[i][j].clear();
	for (int i=0;i<(int)s.size();++i)
	{
		ps[i+1]=ps[i]+(s[i]=='(')-(s[i]==')');
		if (pri[s[i]]!=-1) poj[ps[i]][pri[s[i]]].pb(i);
	}
	st=s;
	return ev(0,s.size());
}

int eval(string s,int x,int y)
{
	for (auto&c: s)
	{
		if (c=='x') c=x+'0';
		if (c=='y') c=y+'0';
	}
	return eva(s);
}

int n,k;
bool br[20][20][3][3];
vector<pair<pii,pair<array<int,4>,int>>> ops;
bitset<M> adj[M],con[M];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	memset(pri,-1,sizeof(pri));
	for (int i=0;i<(int)priord.size();++i) pri[priord[i]]=i;
	cin>>n>>k;
	for (int i=0;i<n;++i)
	{
		int x,y,r;
		string u;
		cin>>x>>y>>u>>r;
		--x;
		--y;
		bool worth=0;
		array<int,4> vas;
		for (int a=0;a<2;++a) for (int b=0;b<2;++b)
		{
			vas[a*2+b]=eval(u,a,b);
			//cout<<a<<' '<<b<<' '<<vas[a*2+b]<<en;
			if (vas[a*2+b] && !br[x][y][a][b])
			{
				br[x][y][a][b]=1;
				worth=1;
			}
		}
		if (worth)
		{
			ops.pb({{x,y},{vas,r}});
		}
	}
	int def;
	cin>>def;
	assert(ops.size()<=4*k*k);
	for (int b1=0;b1<(1<<k);++b1) for (int b2=0;b2<(1<<k);++b2)
	{
		int va=-1;
		for (auto x: ops)
		{
			if (x.y.x[((b1>>x.x.x)&1)*2+((b2>>x.x.y)&1)])
			{
				va=x.y.y;
				break;
			}
		}
		if (va==-1) va=def;
		//cout<<b1<<' '<<b2<<' '<<va<<en;
		adj[b1][b2]=va;
		con[b2][b1]=va;
	}
	int an1=0,an2=0,an3=0,m=1<<k;
	for (int i=0;i<m;++i) an1+=adj[i][i];
	for (int i=0;i<m;++i) for (int j=0;j<m;++j) an2+=adj[i][j] && adj[j][i];
	for (int i=0;i<m;++i) for (int j=0;j<m;++j) if (!adj[i][j]) an3+=(adj[i]&con[j]).count();
	cout<<an1<<' '<<an2<<' '<<an3<<en;
}