#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k; cin >> n >> k;
    vector<vector<vector<int>>> calc(k, vector<vector<int>>(k, vector<int>(4, -1)));
    vector<tuple<int,int,int,int>> memo;
    for (int i = 0; i < n; ++i) {
        int a,b; cin >> a >> b;
        a -= 1, b -= 1;
        string s; cin >> s;
        int res; cin >> res;
        for (int j = 0; j < 4; ++j) {
            if (calc[a][b][j] != -1) continue;
            int x = (j&1), y = (j&2)/2;
            auto f = [&](auto f, int &idx) -> int {
                vector<int> val;
                vector<char> op;
                int no = 0;
                while (idx < s.size()) {
                    if (s[idx] == '(') {
                        idx += 1;
                        val.push_back(f(f, idx) ^ no);
                    } else if (s[idx] == ')') {
                        idx += 1;
                        break;
                    } else if (s[idx] == '!') {
                        no ^= 1;
                        idx += 1;
                    } else if (s[idx] == 'x') {
                        val.push_back(x ^ no);
                        idx += 1;
                    } else if (s[idx] == 'y') {
                        val.push_back(y ^ no);
                        idx += 1;
                    } else if (isdigit(s[idx])) {
                        val.push_back((s[idx] - '0') ^ no);
                        idx += 1;
                    } else {
                        op.push_back(s[idx]);
                        no = 0;
                        idx += 1;
                    }
                }
                for (char c : vector<char>{'=', '&', '|', '^'}) {
                    vector<int> n_val = {val[0]};
                    vector<char> n_op;
                    for (int l = 0; l < op.size(); ++l) {
                        if (op[l] == c) {
                            if (c == '=') {
                                n_val.back() = (n_val.back() == val[l+1]);
                            } else if (c == '&') {
                                n_val.back() = (n_val.back() & val[l+1]);
                            } else if (c == '|') {
                                n_val.back() = (n_val.back() | val[l+1]);
                            } else {
                                n_val.back() = (n_val.back() ^ val[l+1]);
                            }
                        } else {
                            n_val.push_back(val[l+1]);
                            n_op.push_back(op[l]);
                        }
                    }
                    swap(val, n_val);
                    swap(op, n_op);
                }
                return val[0];
            };
            int idx = 0;
            int uo = f(f, idx);
            if (uo) {
                calc[a][b][j] = res;
                memo.emplace_back(a, b, j, res);
            }
        }
    }
    {
        int res; cin >> res;
        for (int i = 0; i < k; ++i) {
            for (int j = 0; j < k; ++j) {
                for (int l = 0; l < 4; ++l) {
                    if (calc[i][j][l] == -1) {
                        calc[i][j][l] = res;
                        memo.emplace_back(i, j, l, res);
                    }
                }
            }
        }
    }

    vector<vector<bool>> dp(1<<k, vector<bool>(1<<k));
    vector<vector<bool>> used(1<<k, vector<bool>(1<<k));
    for (auto [a, b, c, d] : memo) {
        for (int i = 0; i < (1<<k); ++i) {
            for (int j = 0; j < (1<<k); ++j) {
                if (used[i][j]) continue;
                int x = ((1<<a)&i ? 1 : 0);
                int y = ((1<<b)&j ? 2 : 0);
                if (x + y == c) {
                    dp[i][j] = d;
                    used[i][j] = true;
                }
            }
        }
    }
    int r1 = 0, r2 = 0, r3 = 0;
    for (int i = 0; i < (1<<k); ++i) {
        if (dp[i][i]) r1 += 1;
    }
    for (int i = 0; i < (1<<k); ++i) {
        for (int j = 0; j < (1<<k); ++j) {
            if (dp[i][j]) {
                if (dp[j][i]) r2 += 1;
            }
        }
    }
    for (int i = 0; i < (1<<k); ++i) {
        for (int j = 0; j < (1<<k); ++j) {
            if (!dp[i][j]) continue;
            for (int l = 0; l < (1<<k); ++l) {
                if (!dp[j][l]) continue;
                if (!dp[i][l]) r3 += 1;
            }
        }
    }
    cout << r1 << " " << r2 << " " << r3 << endl;
}