#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define drep(i,a,b) for (int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

#define fir first
#define sec second

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	
	int n,k; cin>>n>>k;
	vector<int> ret(4*k*k,-1);
	auto id=[&](int p,int x,int q,int y)
	{
		return (x*k+p)*(2*k)+(y*k+q); 
	};
	
	vector<array<int,4> > ord;
	rep(wtf,0,n-1)
	{
		int a,b,r;
		string s; 
		cin>>a>>b>>s>>r; a--,b--; 
		int len=s.size();
		
		vector<int> mat(len),stk;
		rep(i,0,len-1)
		{
			if (s[i]=='(') stk.push_back(i);
			else if (s[i]==')')
			{
				assert(stk.size());
				mat[stk.back()]=i;
				mat[i]=stk.back();
				stk.pop_back();
			}
			else mat[i]=i;
		}
		
		auto isop=[&](int p) -> int
		{
			char c=s[p];
			return c=='^'||c=='&'||c=='|'||c=='=';
		};
		auto dc=[&](auto &&self,int l,int r) -> array<int,4> // x*2+y
		{
			assert(l<=r);
			if (l==r)
			{
				char c=s[l];
				if (c=='0') return {0,0,0,0};
				if (c=='1') return {1,1,1,1};
				if (c=='x') return {0,0,1,1};
				if (c=='y') return {0,1,0,1};
				assert(0);
			}
			if (s[r]==')')
			{
				int m=mat[r];
				if (m==l) return self(self,l+1,r-1);
			}
			auto rs=self(self,mat[r],r);
			int p=mat[r]-1;
			while (p>=l&&s[p]=='!')
			{
				rep(i,0,3) rs[i]^=1;
				p--;
			}
			if (p==l-1) return rs;
			auto ls=self(self,l,p-1);
			assert(isop(p));
			rep(i,0,3) 
			{
				if (s[p]=='^') ls[i]^=rs[i];
				if (s[p]=='&') ls[i]&=rs[i];
				if (s[p]=='|') ls[i]|=rs[i];
				if (s[p]=='=') ls[i]=(ls[i]==rs[i]);
			}
			return ls; 
		};
		auto f=dc(dc,0,len-1);
		rep(s,0,3) if (f[s])
		{
			int i=s>>1,j=s&1,k=id(a,i,b,j);
			if (ret[k]!=-1) continue;
			ret[k]=r;
			ord.push_back({a,i,b,j});
		}
	}
	int bad; cin>>bad;
	
	vector<vector<int> > a(1<<k,vector<int>(k));
	rep(s,0,(1<<k)-1) rep(i,0,k-1) a[s][i]=(s>>i)&1;
	
	auto cmp=[&](int x,int y) -> int
	{	
		for (auto it:ord)
		{
			int i=it[0],p=it[1],j=it[2],q=it[3];
			if (a[x][i]==p&&a[y][j]==q) return ret[id(i,p,j,q)];
		}
		return bad;
	};
	vector<vector<int> > f(1<<k,vector<int>(1<<k));
	rep(i,0,(1<<k)-1) rep(j,0,(1<<k)-1) f[i][j]=cmp(i,j);
	
	vector<bitset<1<<10> > g(1<<k);
	rep(i,0,(1<<k)-1) rep(j,0,(1<<k)-1) if (f[i][j]) g[i][j]=1;
	
	int ans1=0,ans2=0;
	ll ans3=0;
	rep(i,0,(1<<k)-1) if (f[i][i]==1) ans1++;
	rep(i,0,(1<<k)-1) rep(j,0,(1<<k)-1) if (f[i][j]==1&&f[j][i]==1) ans2++;
	rep(i,0,(1<<k)-1) rep(j,0,(1<<k)-1) if (f[i][j]==1)
	{
		ans3+=(g[j]&(~g[i])).count();
	} 
	
	printf("%d %d %lld\n",ans1,ans2,ans3);
	
	return 0;
}