#include <bits/stdc++.h>

using namespace std;

bool calc(string T) {
    vector<bool> p; vector<int> q;
    auto calc = [&](bool x, bool y, int z) -> bool {
        if (z == 0) return x ^ y;
        if (z == 1) return x | y;
        if (z == 2) return x & y;
        return x == y;
    };
    auto pop = [&]() {
        if (q.back() == 4) p.back() = !p.back();
        else p.end()[-2] = calc(p.back(), p.end()[-2], q.back()), p.pop_back();
        q.pop_back();
    };
    reverse(T.begin(), T.end());
    for (auto c : T) {
        if (isdigit(c)) p.push_back(c ^ '0');
        else if (c == ')') q.push_back(-2);
        else {
            int v = (c == '(' ? -1 : (c == '^' ? 0 : (c == '|' ? 1 : (c == '&' ? 2 : (c == '=' ? 3 : 4)))));
            while (!q.empty() && q.back() > v) pop();
            if (v == -1) q.pop_back(); else q.push_back(v);
        }
    }
    while (!q.empty()) pop();
    return p[0];
}

const int M = 10;

bool f[1 << M][1 << M];
bitset<1 << M> f1[1 << M], f2[1 << M];

signed main() {
    int n, m; scanf("%d%d", &n, &m);
    vector< pair< pair< pair<int, int>, pair<int, int> >, int> > tp;
    map< pair< pair<int, int>, pair<int, int> >, int> M;
    for (int i = 1; i <= n; ++i) {
        int x, y; scanf("%d%d", &x, &y);
        string S; cin >> S;
        int z; scanf("%d", &z);
        for (int j = 0; j < 2; ++j)
        for (int k = 0; k < 2; ++k) {
            if (M.count(make_pair(make_pair(x, j), make_pair(y, k)))) continue;
            string T = S;
            replace(T.begin(), T.end(), 'x', (char)(j + '0'));
            replace(T.begin(), T.end(), 'y', (char)(k + '0'));
            if (calc(T)) {
                M[make_pair(make_pair(x, j), make_pair(y, k))] = 1;
                tp.push_back(make_pair(make_pair(make_pair(x, j), make_pair(y, k)), z));
            }
        }
    }
    string T; cin >> T;
    int res1 = 0, res2 = 0, res3 = 0;
    for (int i = 0; i < 1 << m; ++i) 
    for (int j = 0; j < 1 << m; ++j) {
        bool g = T[0] - '0';
        for (auto [x, y] : tp) {
            if (((i >> (x.first.first - 1)) & 1) == x.first.second && ((j >> (x.second.first - 1)) & 1) == x.second.second) {
                g = y; break;
            }
        }
        f[i][j] = g;
        res1 += (i == j && f[i][j]);
        if (f[i][j]) f1[i][j] = 1, f2[j][i] = 1;
    }
    for (int i = 0; i < 1 << m; ++i)
    for (int j = 0; j < 1 << m; ++j) {
        res2 += f[i][j] && f[j][i];
    }
    for (int i = 0; i < 1 << m; ++i)
    for (int j = 0; j < 1 << m; ++j) if (!f[i][j]) {
        res3 += (f1[i] & f2[j]).count();
    }
    printf("%d %d %d\n", res1, res2, res3);
    return 0;
}