#include <bits/stdc++.h>
using namespace std;

using ll = long long;
//#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

using row=array<bool,2>;
using table=array<row,2>;

struct Parser
{
    string s;
    bool x,y;
    int ind=0;
    char cur()
    {
        if(ind==s.size()) return ')';
        else return s[ind];
    }
    char next()
    {
        if(ind==s.size()) return ')';
        else return s[ind++];
    }
    bool par_expr()
    {
        switch(next())
        {
            case '0': return 0;
            case '1': return 1;
            case 'x': return x;
            case 'y': return y;
            case '(': {
                bool res = xor_expr();
                assert(next() == ')');
                return res;
            }
            case '!': return !par_expr();
            default:
                assert(false);
        }
    }
    bool xor_expr()
    {
        int res=or_expr();
        while(cur()=='^') next(),res^=or_expr();
        return res;
    }
    bool or_expr()
    {
        int res=and_expr();
        while(cur()=='|') next(),res|=and_expr();
        return res;
    }
    bool and_expr()
    {
        int res=eq_expr();
        while(cur()=='&') next(),res&=eq_expr();
        return res;
    }
    bool eq_expr()
    {
        int res=par_expr();
        while(cur()=='=') next(),res=res==par_expr();
        return res;
    }
};

table read()
{
    string s;
    cin>>s;
    table res= {
        row{Parser{s,0,0}.xor_expr(),Parser{s,0,1}.xor_expr()},
        row{Parser{s,1,0}.xor_expr(),Parser{s,1,1}.xor_expr()}
    };
//    cout<<s<<" -> "<<res[0][0]<<res[0][1]<<res[1][0]<<res[1][1]<<"\n";
    return res;
}

const int N=1<<10;

int dp[1111][1111];
bool killed[10][10][2][2];
vector<int> setter[10][2];

bitset<N> lr[N];

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, k;
    cin>>n>>k;
    for (int i=0; i<k; i++)
        for (int j=0; j<k; j++)
            for (int x=0; x<2; x++)
                for (int y=0; y<2; y++)
                    killed[i][j][x][y] = false;
    for (int i=0; i<(1<<k); i++)
        for (int j=0; j<(1<<k); j++)
            dp[i][j] = -1;
    for (int i=0; i<(1<<k); i++)
        for (int j=0; j<k; j++)
            setter[j][(i>>j)&1].pb(i);

    while (n--)
    {
        int x, y, val;
        cin>>x>>y;
        x--;y--;
        auto res = read();
        cin>>val;

        for (int i=0; i<2; i++)
            for (int j=0; j<2; j++)
                if (res[i][j])
                    if (!killed[x][y][i][j])
                    {
                        killed[x][y][i][j] = true;
                        for (int a : setter[x][i])
                            for (int b : setter[y][j])
                                if (dp[a][b] == -1)
                                    dp[a][b] = val;
                    }
    }
    int val;
    cin>>val;
    n = 1<<k;
    for (int a=0; a<n; a++)
        for (int b=0; b<n; b++)
            if (dp[a][b] == -1)
                dp[a][b] = val;

    int r=0, s=0, t=0;
    for (int i=0; i<n; i++)
        if (dp[i][i] == 1) r++;
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            if (dp[i][j] * dp[j][i] == 1) s++;

    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            lr[i][j]=dp[i][j];
    for(int x=0;x<n;x++)
        for(int y=0;y<n;y++)
            if(dp[x][y])
                t+=(lr[y]&~lr[x]).count();

//    for (int i=0; i<n; i++, cout<<"\n")
//        for (int j=0; j<n; j++)
//            cout<<dp[i][j]<<" ";



    cout<<r<<" "<<s<<" "<<t<<"\n";
}