#include<bits/stdc++.h>
using namespace std;
template<typename T>
class Stack{
    private:
        T stk[1000001];
        int stktop=0;
    public:
        inline bool empty(){return !stktop;}
        inline int size(){return stktop;}
        inline T top(){if(!stktop) assert(false);return stk[stktop];}
        inline void push(const T &x){stk[++stktop]=x;}
        inline void pop(){if(stktop<0) assert(false);stktop--;}
};
class Expression{
    private:
        inline bool check_operator(char c)
        {
            return c=='&'||c=='|'||c=='!'||c=='='||c=='^';
        }
        inline int operator_num(char c)
        {
            if(c=='^')
                return 1;
            if(c=='|')
                return 2;
            if(c=='&')
                return 3;
            if(c=='=')
                return 4;
            if(c=='!')
                return 6;
            return 5;
        }
        Stack<char>fix;
        Stack<char>formula;
        Stack<char>num;
        Stack<char>st;
        inline void postfix(string s)
        {
            s=s+'@';
            for(int i=0;i<s.length();i++)
            {
                if(s[i]=='(')
                    st.push(s[i]);
                else if(s[i]==')')
                {
                    while(st.top()!='(')
                    {
                        fix.push(st.top());
                        st.pop();
                    }
                    st.pop();
                }
                else if(check_operator(s[i]))
                {
                    if(s[i]=='!')
                    {
                        int j=i,cnt=0;
                        while(j<s.length()&&s[j]=='!')
                            cnt++,j++;
                        if(cnt>1)
                        {
                            if(cnt&1)
                                i=j-2;
                            else
                                i=j-1;
                            continue;
                        }
                    }
                    while(!st.empty()&&st.top()!='('&&operator_num(st.top())>=operator_num(s[i]))
                    {
                        fix.push(st.top());
                        st.pop();
                    }
                    st.push(s[i]);
                }
                else if(s[i]=='0'||s[i]=='1')
                    fix.push(s[i]);
                else
                {
                    while(!st.empty())
                    {
                        fix.push(st.top());
                        st.pop();
                    }
                }
            }
        }
        inline void reverse_stack()
        {
            while(!fix.empty())
            {
                formula.push(fix.top());
                fix.pop();
            }
        }
        inline bool GetVal(const char &c)
        {
            return c=='1';
        }
        inline char GetChar(const bool &f)
        {
            return f?'1':'0';
        }
        inline char calculate()
        {
            while(!formula.empty())
            {
                char now=formula.top();
                formula.pop();
                if(!check_operator(now))
                    num.push(now);
                else
                {
                    if(now=='&')
                    {
                        bool a=GetVal(num.top());
                        num.pop();
                        bool b=GetVal(num.top());
                        num.pop();
                        num.push(GetChar(a&b));
                    }
                    else if(now=='|')
                    {
                        bool a=GetVal(num.top());
                        num.pop();
                        bool b=GetVal(num.top());
                        num.pop();
                        num.push(GetChar(a|b));
                    }
                    else if(now=='!')
                    {
                        bool a=GetVal(num.top());
                        num.pop();
                        num.push(GetChar(!a));
                    }
                    else if(now=='^')
                    {
                        bool a=GetVal(num.top());
                        num.pop();
                        bool b=GetVal(num.top());
                        num.pop();
                        num.push(GetChar(a^b));
                    }
                    else
                    {
                        bool a=GetVal(num.top());
                        num.pop();
                        bool b=GetVal(num.top());
                        num.pop();
                        num.push(GetChar(a==b));
                    }
                }
            }
            char ans=num.top();
            num.pop();
            return ans;
        }
    public:
        inline bool work(const string &expr)
        {
            postfix(expr);
            reverse_stack();
            return calculate()=='1';
        }
};
Expression E;
struct Lim{
    int a,x,b,y,r;
};
vector<Lim>L;
bool vis[11][2][11][2];
int res[1<<10][1<<10];
bitset<1024>f[1<<10],g[1<<10];
int main(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        int a,b,r;
        string expr;
        cin>>a>>b>>expr>>r;
        for(int x: {0,1})
            for(int y: {0,1})
            {
                string upd=expr;
                for(auto &ch: upd)
                {
                    if(ch=='x')
                        ch=(char)(x+'0');
                    if(ch=='y')
                        ch=(char)(y+'0');
                }
                if(E.work(upd))
                {
                    if(!vis[a][x][b][y])
                        L.push_back({a,x,b,y,r});
                    vis[a][x][b][y]=true;
                }
            }
    }
    memset(res,-1,sizeof(res));
    for(auto [a,x,b,y,r]: L)
    {
        for(int s=0;s<(1<<k);s++)
            for(int t=0;t<(1<<k);t++)
            {
                int g=((s>>(a-1))&1);
                int h=((t>>(b-1))&1);
                if(g==x&&h==y&&res[s][t]==-1)
                    res[s][t]=r;
            }
    }
    int z;
    cin>>z;
    for(int i=0;i<(1<<k);i++)
        for(int j=0;j<(1<<k);j++)
            if(res[i][j]==-1)
                res[i][j]=z;
    int vRefl=0,vSym=0,vTrans=0;
    for(int i=0;i<(1<<k);i++)
        if(res[i][i])
            vRefl++;
    for(int i=0;i<(1<<k);i++)
        for(int j=0;j<(1<<k);j++)
            if(res[i][j]&&res[j][i])
                vSym++;
    for(int i=0;i<(1<<k);i++)
        for(int j=0;j<(1<<k);j++)
            if(res[i][j])
            {
                f[i][j]=1;
                g[j][i]=1;
            }
    for(int i=0;i<(1<<k);i++)
        for(int j=0;j<(1<<k);j++)
            if(!res[i][j])
                vTrans+=(f[i]&g[j]).count();
    cout<<vRefl<<" "<<vSym<<" "<<vTrans<<endl;
    
    return 0;
}