#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < (b); i++)
#define all(a) begin(a), end(a)
#define sz(a) ssize(a)
bool chmin(auto& a, auto b) { if(a <= b) return 0; a = b; return 1; }
bool chmax(auto& a, auto b) { if(a >= b) return 0; a = b; return 1; }

using Expr = uint32_t;
string s;
bool seek(char c) {
    return sz(s) && s.back() == c;
}
char get() {
    char c = s.back();
    s.pop_back();
    return c;
}
Expr e_xor();
Expr e_paren() {
    const char c = get();
    if(c == ')') {
        Expr ans = e_xor();
        assert(get() == '(');
        return ans;
    }
    if(c == '0') return 0b0000;
    if(c == '1') return 0b1111;
    if(c == 'x') return 0b1010;
    if(c == 'y') return 0b1100;
    __builtin_unreachable();
}
Expr e_not() {
    Expr ans = e_paren();
    while(seek('!')) {
        s.pop_back();
        ans = ~ans;
    }
    return ans;
}
Expr e_iff() {
    Expr right = e_not();
    if(!seek('=')) return right;
    s.pop_back();
    Expr left = e_iff();
    return ~(left^right);
}
Expr e_and() {
    Expr right = e_iff();
    if(!seek('&')) return right;
    s.pop_back();
    Expr left = e_and();
    return left&right;
}
Expr e_or() {
    Expr right = e_and();
    if(!seek('|')) return right;
    s.pop_back();
    Expr left = e_or();
    return left|right;
}
Expr e_xor() {
    Expr right = e_or();
    if(!seek('^')) return right;
    s.pop_back();
    Expr left = e_xor();
    return left^right;
}
Expr eval(string s_) {
    s = move(s_);
    Expr ans = e_xor();
    assert(s.empty());
    return ans;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll N, K;
    cin >> N >> K;
    vector priority(K * 2, vector(K * 2, pair{INF, false}));
    rep(p, 0, N) {
        ll a, b;
        string expr;
        bool r;
        cin >> a >> b >> expr >> r;
        a--; b--;
        const Expr e = eval(expr);
        rep(x, 0, 2) rep(y, 0, 2) if(e & 1 << (x | y << 1)) {
            chmin(priority[a * 2 + x][b * 2 + y], pair{p, r});
        }
    }
    bool fallback;
    cin >> fallback;
    for(auto& v : priority) for(auto& x : v) chmin(x, pair{N, fallback});
    auto f = [&](ll X, ll Y) {
        static auto ps = [&] {
            vector<array<ll, 4>> ps;
            rep(x, 0, K * 2) rep(y, 0, K * 2) {
                auto [pri, val] = priority[x][y];
                ps.push_back({pri, x, y, val});
            }
            ranges::sort(ps);
            return ps;
        }();
        for(auto [_, a, b, val] : ps) {
            const bool x = (X >> (a >> 1) & 1) == (a & 1);
            const bool y = (Y >> (b >> 1) & 1) == (b & 1);
            if(x && y) return val;
        }
    };
    const ll MX = 1 << K;
    vector<bitset<1024>> F(MX);
    rep(x, 0, MX) rep(y, 0, MX) F[x][y] = f(x, y);

    cout << [&]{
        ll ans = 0;
        rep(x, 0, MX) ans += F[x][x];
        return ans;
    }() << " " << [&]{
        ll ans = 0;
        rep(x, 0, MX) rep(y, 0, MX) ans += F[x][y] && F[y][x];
        return ans;
    }() << " " << [&]{
        ll ans = 0;
        rep(x, 0, MX) rep(y, 0, MX) if(F[x][y]) ans += (~F[x] & F[y]).count();
        return ans;
    }() << "\n";
}