#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n , k;
char ope[1000005];
int top1;
bool num[1000005];
int top2;

int prio(char x) {
    if(x == '(' || x == ')') return 0;
    else if(x == '!') return 5;
    else if(x == '=') return 4;
    else if(x == '&') return 3;
    else if(x == '|') return 2;
    else if(x == '^') return 1;
    else return -1;
}
void pop_op() {
    char a = ope[top1] ; top1--;
    if(a == '!') {
        num[top2] ^= 1;
        return ;
    }
    int x = num[top2] , y = num[top2 - 1] ;
    top2 -= 2;
    int z;
    if(a == '=') z = (x == y) ;
    else if(a == '&') z = (x && y);
    else if(a == '|') z = (x || y);
    else if(a == '^') z = (x ^ y) ;
    else { printf("A %c\n",a) ; assert(0) ;}
    num[++top2] = z;
    return ;
}
bool evalu(const string& s,int vx,int vy) {
    top1 = top2 = 0;
    // cout << "EVA : " << vx <<' ' << vy << ' ' << s << ' ' ;
    for(int i = 0;i < s.size();i++) {
        // printf("OK %c\n",s[i]);
        if(prio(s[i]) >= 0) { ///符号
            if(s[i] == '(') {
                ope[++top1] = s[i] ; continue ;
            }
            else if(s[i] == ')') {
                while(ope[top1] != '(') pop_op() ;
                top1-- ; continue ;
            }
            while(top1 > 0 && (prio(ope[top1]) > prio(s[i])) || (ope[top1] == s[i] && s[i] != '!')) pop_op() ;
            ope[++top1] = s[i] ;
        }
        else {
            bool val;
            if(s[i] == '0') val = 0;
            else if(s[i] == '1') val = 1;
            else if(s[i] == 'x') val = vx;
            else if(s[i] == 'y') val = vy;
            else assert(0) ;

            num[++top2] = val;
        }
    }
    while(top1) pop_op() ;
    // cout << num[top2] << '\n';
    return num[top2] ;
}

int op[10][10][2][2] ;
vector<array<int,5> > vec;
bool f[1 << 10][1<< 10];
bitset<1024> c0[1<<10] , c1[1<<10];
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ; 
    cin >> n >> k;
    memset(op,-1,sizeof(op)) ;
    for(int i = 1;i <= n;i++) {
        int u , v ;
        string s;
        int r;
        cin >> u >> v >> s >> r; u-- ; v--;
        for(int a = 0; a < 2;a++) {
            for(int b = 0;b < 2;b++) {
                if(op[u][v][a][b] != -1) continue ;
                if(evalu(s , a , b)) {
                    op[u][v][a][b] = 1;
                    vec.push_back({u,v,a,b,r}) ;
                }
            }
        }
    }
    int lst  ; cin >> lst;
    for(int i = 0;i < (1<<k);i++) {
        for(int j = 0;j < (1<<k);j++) {
            f[i][j] = lst;
            for(auto &p : vec) {
                if(((i >> p[0])&1) == p[2] && ((j >> p[1]) & 1) == p[3]) {
                    f[i][j] = p[4] ; break ;
                }
            }
        }
    }
    int ans = 0;
    for(int i = 0;i < (1<<k);i++) {
        if(f[i][i]) ans++ ;
    }
    cout << ans <<' ' ; /// a0
    ans = 0;
    for(int i = 0;i < (1<<k);i++) {
        for(int j = 0;j < (1<<k);j++) {
            if(f[i][j] && f[j][i]) ans++ ;
        }
    }
    cout << ans <<' ' ; /// a1
    ans = 0;
    for(int i = 0;i < (1<<k);i++) {
        for(int j = 0;j < (1<<k);j++) {
            // r0[i][j] = f[i][j] ;
            // r1[i][j] = (1 ^ f[i][j]) ;
            c0[j][i] = f[i][j] ;
            c1[j][i] = (1 ^ f[i][j]) ;
        }
    }
    
    for(int i = 0;i < (1<<k);i++) {
        for(int j = 0;j < (1<<k);j++) {
            if(f[i][j]) {
                ans += (c0[i] & c1[j]).count() ;
            }
        }
    }
    cout << ans << '\n';
    return 0;
}