#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


const string OPS = "^|&=";
int oper(int op, int x, int y) {
  if (op == 0) return x ^ y;
  if (op == 1) return x | y;
  if (op == 2) return x & y;
  if (op == 3) return 15 ^ x ^ y;
  assert(false);
}

char S[1'000'010];
int cur;
int expr(int p) {
  if (p < 4) {
    int ret = expr(p + 1);
    for (; S[cur] == OPS[p]; ) {
      ++cur;
      const int res = expr(p + 1);
      ret = oper(p, ret, res);
    }
    return ret;
  } else if (p == 4) {
    int cnt = 0;
    for (; S[cur] == '!'; ) {
      ++cur;
      ++cnt;
    }
    const int res = expr(5);
    return (cnt & 1) ? (15 ^ res) : res;
  } else if (p == 5) {
    const char c = S[cur++];
    if (c == 'x') return 1<<1 | 1<<3;
    if (c == 'y') return 1<<2 | 1<<3;
    if (c == '0') return 0;
    if (c == '1') return 15;
    if (c == '(') {
      const int res = expr(0);
      assert(S[cur] == ')');
      ++cur;
      return res;
    }
    assert(false);
  } else {
    assert(false);
  }
}

int parse() {
  scanf("%s", S);
  cur = 0;
  const int res = expr(0);
// cerr<<S<<" ";for(int u=0;u<4;++u)cerr<<(res>>u&1);cerr<<endl;
  return res;
}

int N, K;
bool used[11][11][2][2];
vector<int> A, B, P, Q, R;
int R0;

int F(int x, int y) {
  for (int i = 0; i < N; ++i) {
    if ((x >> A[i] & 1) == P[i] && (y >> B[i] & 1) == Q[i]) {
      return R[i];
    }
  }
  return R0;
}
bitset<(1 << 10)> f[1 << 10], g[1 << 10];

int main() {
  for (; ~scanf("%d%d", &N, &K); ) {
    memset(used, 0, sizeof(used));
    A.clear();
    B.clear();
    P.clear();
    Q.clear();
    R.clear();
    for (int i = 0; i < N; ++i) {
      int a, b;
      scanf("%d%d", &a, &b);
      --a;
      --b;
      const int res = parse();
      int r;
      scanf("%d", &r);
      for (int p = 0; p < 2; ++p) for (int q = 0; q < 2; ++q) {
        if (res >> (p | q << 1) & 1) {
          if (!used[a][b][p][q]) {
            used[a][b][p][q] = true;
            A.push_back(a);
            B.push_back(b);
            P.push_back(p);
            Q.push_back(q);
            R.push_back(r);
          }
        }
      }
    }
    scanf("%d", &R0);
    N = A.size();
    
#define rep(x) for (int x = 0; x < 1 << K; ++x)
    rep(x) rep(y) {
      const int res = F(x, y);
      f[x][y] = res;
      g[y][x] = res;
    }
    int ans[3] = {};
    rep(x) if (f[x][x]) ++ans[0];
    rep(x) rep(y) if (f[x][y] && f[y][x]) ++ans[1];
    rep(x) rep(z) if (!f[x][z]) ans[2] += (f[x] & g[z]).count();
    printf("%d %d %d\n", ans[0], ans[1], ans[2]);
  }
  return 0;
}