#include <bits/stdc++.h>

using i64 = long long;

constexpr int K = 1024;

int priority(char c) {
    if (c == '(') {
        return -1;
    } else if (c == '!') {
        return 5;
    } else if (c == '=') {
        return 4;
    } else if (c == '&') {
        return 3;
    } else if (c == '|') {
        return 2;
    } else if (c == '^') {
        return 1;
    }
    return 10;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, k;
    std::cin >> n >> k;
    
    std::vector vis(k, std::vector(k, std::array<std::array<int, 2>, 2>{}));
    
    std::vector f(1 << k, std::bitset<K>{});
    std::vector vf(1 << k, std::bitset<K>{});
    
    for (int i = 0; i < n; i++) {
        int a, b;
        std::string expr;
        int r;
        std::cin >> a >> b >> expr >> r;
        a--, b--;
        
        std::vector<char> stk;
        std::string suf;
        for (auto c : expr) {
            if (c == 'x' || c == 'y' || c == '0' || c == '1') {
                stk.push_back(c);
            } else if (c == '(') {
                stk.push_back(c);
            } else if (c == ')'){
                while (stk.back() != '(') {
                    suf += stk.back();
                    stk.pop_back();
                }
                stk.pop_back();
            } else {
                while (!stk.empty() && priority(c) < priority(stk.back())) {
                    suf += stk.back();
                    stk.pop_back();
                }
                stk.push_back(c);
            }
        }
        while (!stk.empty()) {
            suf += stk.back();
            stk.pop_back();
        }
        for (int x = 0; x < 2; x++) {
            for (int y = 0; y < 2; y++) {
                if (vis[a][b][x][y]) {
                    continue;
                }
                std::vector<int> v;
                for (auto c : suf) {
                    if (c == '0') {
                        v.push_back(0);
                    } else if (c == '1') {
                        v.push_back(1);
                    } else if (c == 'x') {
                        v.push_back(x);
                    } else if (c == 'y') {
                        v.push_back(y);
                    } else if (c == '!') {
                        v.back() ^= 1;
                    } else {
                        int a = v.back();
                        v.pop_back();
                        int b = v.back();
                        v.pop_back();
                        if (c == '=') {
                            v.push_back(a == b);
                        } else if (c == '&') {
                            v.push_back(a & b);
                        } else if (c == '|') {
                            v.push_back(a | b);
                        } else if (c == '^') {
                            v.push_back(a ^ b);
                        }
                    }
                }
                assert(v.size() == 1);
                if (v[0]) {
                    vis[a][b][x][y] = 1;
                    for (int i = 0; i < (1 << k); i++) {
                        if ((i >> a & 1) == x) {
                            for (int j = 0; j < (1 << k); j++) {
                                if ((j >> b & 1) == y && !vf[i][j]) {
                                    f[i][j] = r;
                                    vf[i][j] = 1;
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    
    int r;
    std::cin >> r;
    for (int i = 0; i < (1 << k); i++) {
        for (int j = 0; j < (1 << k); j++) {
            if (!vf[i][j]) {
                vf[i][j] = 1;
                f[i][j] = r;
            }
        }
    }
    
    int ans1 = 0, ans2 = 0, ans3 = 0;
    for (int x = 0; x < (1 << k); x++) {
        if (f[x][x]) {
            ans1++;
        }
        for (int y = 0; y < (1 << k); y++) {
            if (f[x][y] && f[y][x]) {
                ans2++;
            }
            if (f[x][y]) {
                ans3 += (f[y] & ~f[x]).count();
            }
        }
    }
    
    std::cout << ans1 << " " << ans2 << " " << ans3 << "\n";
    
    return 0;
}