#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
#define rank rk
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
char s[1000010],opt[1000010];
int num[1000010],res[11][11][2][2],tim[11][11][2][2],n,k,R;
bool f[1<<10][1<<10];
bitset<1024>g[1<<10],h[1<<10];
bool cal(bool x,char op,bool y)
{
    if(op=='=')return x==y;
    else if(op=='&')return x&y;
    else if(op=='|')return x|y;
    else if(op=='^')return x^y;
    else assert(0);
}
int rank(char op)
{
    if(op=='=')return 1;
    else if(op=='&')return 2;
    else if(op=='|')return 3;
    else if(op=='^')return 4;
    else assert(0);
}
bool cal(char s[],int x,int y)
{
    int top1=0,top2=0,n=strlen(s+1);
    rep(i,n)
    if(s[i]=='(')opt[++top1]='(';
    else if(s[i]==')')
    {
        for(;top1&&opt[top1]!='(';top1--,top2--)num[top2-1]=cal(num[top2-1],opt[top1],num[top2]);
        assert(top1&&opt[top1]=='(');
        top1--;
        int now=num[top2--];
        for(;top1&&opt[top1]=='!';now=!now,top1--);
        num[++top2]=now;
    }
    else if(s[i]=='!')opt[++top1]='!';
    else if(s[i]=='x'||s[i]=='y'||s[i]=='0'||s[i]=='1')
    {
        int now;
        if(s[i]=='0'||s[i]=='1')now=s[i]-'0';
        else if(s[i]=='x')now=x;
        else now=y;
        for(;top1&&opt[top1]=='!';now=!now,top1--);
        num[++top2]=now;
    }
    else
    {
        for(;top1&&opt[top1]!='('&&rank(opt[top1])<=rank(s[i]);top1--,top2--)num[top2-1]=cal(num[top2-1],opt[top1],num[top2]);
        opt[++top1]=s[i];
    }
    for(;top1;top1--,top2--)num[top2-1]=cal(num[top2-1],opt[top1],num[top2]);
    assert(top2==1&&!top1);
    return num[1];
}
bool cal(int x,int y)
{
    int mn=n+1;
    bool result=R;
    rep(i,k)rep(j,k)
    {
        int b1=(x>>(i-1))&1,b2=(y>>(j-1))&1;
        if(res[i][j][b1][b2]==-1||tim[i][j][b1][b2]>=mn)continue;
        mn=tim[i][j][b1][b2];
        result=res[i][j][b1][b2];
    }
    return result;
}
int main()
{
    scanf("%d%d",&n,&k);
    rep(i,k)rep(j,k)rep(b1,2)rep(b2,2)res[i][j][b1-1][b2-1]=-1;
    rep(i,n)
    {
        int x,y,r;
        scanf("%d%d%s%d",&x,&y,s+1,&r);
        for(int j=0;j<2;j++)for(int k=0;k<2;k++)if(res[x][y][j][k]==-1&&cal(s,j,k))res[x][y][j][k]=r,tim[x][y][j][k]=i;
    }
    scanf("%d",&R);
    for(int i=0;i<(1<<k);i++)for(int j=0;j<(1<<k);j++)f[i][j]=cal(i,j);
    int ans1=0,ans2=0,ans3=0;
    for(int i=0;i<(1<<k);i++)if(f[i][i])ans1++;
    for(int i=0;i<(1<<k);i++)for(int j=0;j<(1<<k);j++)if(f[i][j]&&f[j][i])ans2++;
    for(int i=0;i<(1<<k);i++)for(int j=0;j<(1<<k);j++)if(f[i][j])g[i].set(j);else h[i].set(j);
    for(int i=0;i<(1<<k);i++)for(int j=0;j<(1<<k);j++)if(f[i][j])ans3+=(h[i]&g[j]).count();
    printf("%d %d %d\n",ans1,ans2,ans3);
    return 0;
}