#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N 
using namespace std;
const int N=200005,M=1024;
int a[N],b[N],c[N];
bool bl[N][2][2];
bitset<M>f[M];
int n,m;
int rl[M],tmp[M];
int vis[M][M];
int lst[N][10][2];
void dfs(int x,int k)
{
	if (k>n||rl[b[k]]!=2)
	{
		int u=0,ad=0;
		for (int i=0;i<m;i++)
			if (rl[i]==2) u|=(1<<i);
			else ad|=(rl[i]<<i);
		for (int i=u;;i=(i-1)&u)
		{
			int v=(ad|i);
			vis[x][v]=1;
			// cout<<x<<","<<v<<" "<<k<<" "<<c[k]<<endl;
			f[x][v]=c[k];
			if (!i) break;
		}
		return;
	}
	for (rl[b[k]]=0;rl[b[k]]<2;rl[b[k]]++)
	{
		if (bl[k][(x>>a[k])&1][rl[b[k]]])
		{
			int u=0,ad=0;
			for (int i=0;i<m;i++)
				if (rl[i]==2) u|=(1<<i);
				else ad|=(rl[i]<<i);
			for (int i=u;;i=(i-1)&u)
			{
				int v=(ad|i);
				vis[x][v]=1;
				// if (x==v)
				// cout<<x<<","<<v<<" "<<k<<" "<<c[k]<<endl;
				f[x][v]=c[k];
				if (!i) break;
			}
		} else
		{
			int op=tmp[b[k]];
			tmp[b[k]]=lst[k][b[k]][rl[b[k]]];
			int nxt=n+1;
			for (int i=0;i<m;i++) nxt=min(nxt,tmp[i]);
			dfs(x,nxt);
			tmp[b[k]]=op;
		}
	}
	rl[b[k]]=2;
}
inline int calc(int x,int y,char c)
{
	if (c=='=') return (x==y);
	if (c=='&') return (x&y);
	if (c=='|') return (x|y);
	return (x^y);
}
int getv(string &st,int l,int r,int x,int y)
{
	vector<char>s;
	vector<int>t;
	for (int i=0;i<sz(st);i++)
	{
		if (st[i]=='(')
		{
			s.push_back('(');
		}
		else
		if (st[i]==')')
		{
			while (s.back()!='(')
			{
				int a=t[sz(t)-2],b=t[sz(t)-1];
				t.pop_back();
				t.pop_back();
				t.push_back(calc(a,b,s.back()));
				s.pop_back();
			}
			s.pop_back();
		}  else
		if (st[i]=='^')
		{
			while (s.back()=='='||s.back()=='|'||s.back()=='^'||s.back()=='&')
			{
				int a=t[sz(t)-2],b=t[sz(t)-1];
				t.pop_back();
				t.pop_back();
				t.push_back(calc(a,b,s.back()));
				s.pop_back();
			}
			s.push_back(st[i]);
		} else
		if (st[i]=='|')
		{
			while (s.back()=='='||s.back()=='&'||s.back()=='|')
			{
				int a=t[sz(t)-2],b=t[sz(t)-1];
				t.pop_back();
				t.pop_back();
				t.push_back(calc(a,b,s.back()));
				s.pop_back();
			}
			s.push_back(st[i]);
		} else
		if (st[i]=='&')
		{
			while (s.back()=='&'||s.back()=='=')
			{
				int a=t[sz(t)-2],b=t[sz(t)-1];
				t.pop_back();
				t.pop_back();
				t.push_back(calc(a,b,s.back()));
				s.pop_back();
			}
			s.push_back(st[i]);
		} else
		if (st[i]=='=')
		{
			while (s.back()=='=')
			{
				int a=t[sz(t)-2],b=t[sz(t)-1];
				t.pop_back();
				t.pop_back();
				t.push_back(calc(a,b,s.back()));
				s.pop_back();
			}
			s.push_back(st[i]);
		} else
		if (st[i]=='!')
		{
			s.push_back(st[i]);
			continue;
		} else
		if (st[i]=='x')
		{
			t.push_back(x);
		} else
		if (st[i]=='y')
		{
			t.push_back(y);
		} else t.push_back(st[i]-'0');

		// cout<<"??"<<st[i]<<" "<<i<<" "<<sz(st)<<endl;
		// for (auto u:s) cout<<u;cout<<endl;
		// for (auto u:t) cout<<u;cout<<endl;
		// cout<<endl;
		while (s.size()&&s.back()=='!')
		{
			t.back()^=1;
			s.pop_back();
		}
		// cout<<"??"<<st[i]<<" "<<i<<" "<<sz(st)<<endl;
		// for (auto u:s) cout<<u;cout<<endl;
		// for (auto u:t) cout<<u;cout<<endl;
		// cout<<endl;
	}
	return t[0];
}
int bfs(int x,int y,int k)
{
	if (k>n||bl[k][(x>>a[k])&1][(y>>b[k])&1])
	{
		return c[k];
	}
	return bfs(x,y,k+1);
}

void BellaKira()
{
	cin>>n>>m;
	for (int i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i];
		string st;
		cin>>st;
		st='('+st+')';
		cin>>c[i];
		a[i]--,b[i]--;
		for (int x=0;x<2;x++)
			for (int y=0;y<2;y++)
			{
				int v=getv(st,0,sz(st)-1,x,y);
				bl[i][x][y]=v;
				// cout<<i<<","<<x<<" "<<y<<"  -> "<<v<<endl;
			}
	}
	cin>>c[n+1];
	for (int u=0;u<(1<<m);u++)
	{
		for (int j=0;j<m;j++)
			lst[n+1][j][0]=lst[n+1][j][1]=n+1;
		for (int i=n;i>=1;i--)
		{
			memcpy(lst[i],lst[i+1],sizeof(lst[i]));
			for (int x=0;x<2;x++)
				if (bl[i][((u>>a[i])&1)][x])
				{
					lst[i][b[i]][x]=i;
				}
		}
		for (int j=0;j<m;j++) 
		{
			rl[j]=2;
			tmp[j]=min(lst[1][j][0],lst[1][j][1]);
		}
		dfs(u,1);
	}
	int ans=0,ans1=0,ans2=0;
	// for (int i=0;i<(1<<m);i++)
	// 	for (int j=0;j<(1<<m);j++) assert(vis[i][j]);
	for (int i=0;i<(1<<m);i++)
	{
		ans+=(f[i][i]==1);
	}
	// for (int i=0;i<(1<<m);i++)
	// 	for (int j=0;j<(1<<m);j++) assert(bfs(i,j,1)==f[i][j]);
	for (int i=0;i<(1<<m);i++)
		for (int j=0;j<(1<<m);j++)
			if (f[i][j]==1&&f[j][i]==1)
			{
				ans1++;
			}
	for (int i=0;i<(1<<m);i++)
		for (int j=0;j<(1<<m);j++)
			if (f[i][j]==1)
			{
				bitset<M>now=f[i];
				now.flip();
				now&=f[j];
				ans2+=now.count();
			}
	cout<<ans<<" "<<ans1<<" "<<ans2<<endl;
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/