#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
#include <map>
#include <cstring>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10, MAXM = 1030, MAXS = 1e6 + 10;

int n, m, alt;

struct Opt
{
    int x, y, a, b, t;
    bool operator < (const Opt u) const
    {
        if (x != u.x) return x < u.x;
        if (y != u.y) return y < u.y;
        if (a != u.a) return a < u.a;
        if (b != u.b) return b < u.b;
        return 0;
    }
}op[MAXM];
int tot;

map <Opt, bool> ocr;

char str[MAXS];
vector <int> st[MAXS], tmp;
inline void Solve(int X, int Y, int T)
{
    int len = strlen(str + 1), lay = 0, cur;
    str[0] = '(', str[++len] = ')';
    for (int x = 0; x < 2; x++)
        for (int y = 0; y < 2; y++)
        {
            st[0].clear();
            for (int i = 0; i <= len; i++)
            {
                if (str[i] == '(') lay++;
                else if (str[i] == ')')
                {
                    // cout << "Lay " << lay << ": ";
                    // for (auto x : st[lay]) cout << x << ' '; cout << "\n";
                    tmp.clear();
                    for (int i = 0; i < st[lay].size(); i++)
                        if (st[lay][i] < 2)
                        {
                            cur = st[lay][i];
                            while (tmp.size() && tmp.back() == 2) cur ^= 1, tmp.pop_back();
                            tmp.push_back(cur);
                        }
                        else tmp.push_back(st[lay][i]);
                    st[lay].clear();
                    for (int i = 0; i < tmp.size(); i++)
                        if (tmp[i] < 2 && st[lay].size() && st[lay].back() == 3)
                        {
                            st[lay].pop_back(), cur = st[lay].back(), st[lay].pop_back();
                            st[lay].push_back(cur == tmp[i]);
                        }
                        else st[lay].push_back(tmp[i]);
                    tmp.clear();
                    for (int i = 0; i < st[lay].size(); i++)
                        if (st[lay][i] < 2 && tmp.size() && tmp.back() == 4)
                        {
                            tmp.pop_back(), cur = tmp.back(), tmp.pop_back();
                            tmp.push_back(cur & st[lay][i]);
                        }
                        else tmp.push_back(st[lay][i]);
                    st[lay].clear();
                    for (int i = 0; i < tmp.size(); i++)
                        if (tmp[i] < 2 && st[lay].size() && st[lay].back() == 5)
                        {
                            st[lay].pop_back(), cur = st[lay].back(), st[lay].pop_back();
                            st[lay].push_back(cur | tmp[i]);
                        }
                        else st[lay].push_back(tmp[i]);
                    tmp.clear();
                    for (int i = 0; i < st[lay].size(); i++)
                        if (st[lay][i] < 2 && tmp.size() && tmp.back() == 6)
                        {
                            tmp.pop_back(), cur = tmp.back(), tmp.pop_back();
                            tmp.push_back(cur ^ st[lay][i]);
                        }
                        else tmp.push_back(st[lay][i]);
                    st[lay].clear();
                    // cout << lay << ' ' << tmp[0] << '\n';
                    st[--lay].push_back(tmp[0]);
                }
                else if (str[i] == '0' || str[i] == '1' || str[i] == 'x' || str[i] == 'y')
                    st[lay].push_back(str[i] == 'x' ? x : (str[i] == 'y' ? y : str[i] - '0'));
                else if (str[i] == '!') st[lay].push_back(2);
                else if (str[i] == '=') st[lay].push_back(3);
                else if (str[i] == '&') st[lay].push_back(4);
                else if (str[i] == '|') st[lay].push_back(5);
                else st[lay].push_back(6);
            }
            // cout << x << ' ' << y << ' ' << st[0][0] << '\n';
            if (!st[0][0]) continue;
            auto tt = Opt{X, Y, x, y, T};
            if (!ocr[tt]) op[++tot] = tt, ocr[tt] = 1;
        }
    // cout << "#\n";
}

bitset <MAXM> e[MAXM], flp;

int main()
{
    // freopen("C.in", "r", stdin);
    // freopen("C.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1, x, y, t; i <= n; i++)
    {
        Read(x), Read(y), Read(str + 1), Read(t);
        Solve(x - 1, y - 1, t);
    }
    Read(alt);
    for (int s = 0; s < (1 << m); s++)
        for (int t = 0; t < (1 << m); t++)
        {
            bool flag = 0;
            for (int i = 1; i <= tot; i++)
                if (((s >> op[i].x) & 1) == op[i].a && ((t >> op[i].y) & 1) == op[i].b)
                {
                    if (op[i].t) e[s].set(t);
                    flag = 1; break;
                }
            if (!flag && alt) e[s].set(t);
        }
    ll ans1 = 0, ans2 = 0, ans3 = 0;
    for (int s = 0; s < (1 << m); s++)
    {
        if (e[s].test(s)) ans1++;
        for (int t = 0; t < (1 << m); t++)
        {
            if (e[s].test(t) && e[t].test(s)) ans2++;
            if (e[s].test(t)) flp = e[s], flp.flip(), ans3 += (flp & e[t]).count();
        }
    }
    cout << ans1 << ' ' << ans2 << ' ' << ans3 << '\n';
    return 0;
}