#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}";
}
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")";
}
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

vector<int> is_op;
vector<int> is_lit;
vector<int> lit_val;

pair<int, int> parse_multiple(const string &s, int pos);

// gdzie skonczyl
pair<int, int> parse_one(const string &s, const int pos) {
  if(is_lit[s[pos]]) {
    return {pos + 1, lit_val[s[pos]]};
  }
  if(s[pos] == '(') {
    auto [epos, ret] = parse_multiple(s, pos + 1);
    assert(s[epos] == ')');
    return {epos + 1, ret};
  }
  if(s[pos] == '!') {
    auto [epos, ret] = parse_one(s, pos+ 1);
    return {epos, ret ^ 0b1111};
  }
  assert(false);
}

using f_t = function<int(int, int)>;

vector<pair<char, f_t>> ops;

int eq(int a, int b) {return (~(a^b)) & 0b1111;}
int an(int a, int b) {return a & b;}
int rr(int a, int b) {return a | b;}
int xr(int a, int b) {return a ^ b;}

pair<int, int> parse_multiple(const string &s, const int pos) {
  vector<int> v;
  int ptr = pos;
  while(ptr < sz(s) && s[ptr] != ')') {
    if(is_op[s[ptr]]) {
      v.emplace_back(s[ptr++]);
      continue;
    }
    else {
      auto [epos, val] = parse_one(s, ptr);
      ptr = epos;
      v.emplace_back(val);
    }
  }
  for(auto [id, op] : ops) {
    int i = 0;
    vector<int> vv;
    while(i < sz(v)) {
      if(v[i] == id) {
        auto val = vv.back();
        vv.pop_back();
        vv.push_back(op(val, v[i + 1]));
        i += 2;
        continue;
      }
      if(is_op[v[i]]) {
        vv.push_back(v[i++]);
        continue;
      }

      assert(v[i] <= 0b1111);
      vv.push_back(v[i]);
      i += 1;
    } 
    v = vv;
  }
  return {ptr, v.back()};
}


int main() {
  cin.tie(0)->sync_with_stdio(0);

  ops = {
    {'=', eq},
    {'&', an},
    {'|', rr},
    {'^', xr},
  };


  is_op.resize(300);
  is_lit.resize(300);
  lit_val.resize(300);

  for(auto i : vector<char>{'=', '&', '|', '^'})
    is_op[i] = 1;

  for(auto i : vector<char>{'x', 'y', '0', '1'})
    is_lit[i] = 1;

  lit_val['0'] = 0b0000;
  lit_val['1'] = 0b1111;
  lit_val['x'] = 0b0011;
  lit_val['y'] = 0b0101;

  int n, k;
  cin >> n >> k;

  const int M = (1 << (k + k));

  vector d00(M, n + 1), d01(M, n + 1), d10(M, n + 1), d11(M, n + 1);

  vector<int> va(n);

  for(int _ = 0; _< n; _++) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    string s;
    cin >> s;
    cin >> va[_];
    auto rr = parse_multiple(s, 0);
    int result = rr.second;

    auto inn = [&] (int &x, int y) {
      x = min(x, y);
    };

    debug(s, result);

    const int mm =   (1 << (a + k)) ^ (1 << b);

    debug(mm);

    if(result & 1)
      inn(d11[mm], _);
    if(result & 2)
      inn(d10[mm], _);
    if(result & 4)
      inn(d01[mm], _);
    if(result & 8)
      inn(d00[mm], _);
  }

  auto fi = [&] (vector<int> &a) {
    rep(i, 0, M) {
      rep(j, 0, 2 * k) {
        if(i & (1 << j)) {
          a[i] = min(a[i], a[i ^ (1 << j)]);
        }
      }
    }
  };

  int pad;
  cin >> pad;

  fi(d00);
  fi(d01);
  fi(d10);
  fi(d11);

  const int hm = (1 << k) - 1;

  using B = bitset<1024>;

  debug(k, M);

  vector<B> ve(1 << k, B());
  rep(i, 0, 1 << k) {
    rep(j, 0, 1 << k) {
      int ve0 = (d00[(i << k) | j]);
      int ve1 = (d01[(i << k) | (j ^ hm)]);
      int ve2 = (d10[((i ^ hm) << k) | j]);
      int ve3 = (d11[((i ^ hm) << k) | (j ^ hm)]);
      int mn = min({ve0, ve1, ve2, ve3});
      if(mn != n + 1)
        ve[i][j] = va[mn];
      else
        ve[i][j] = pad;
      debug(i, j, mn, ve[i][j]);
      debug(ve0, ve1, ve2, ve3);
    }
  } 

  // rep(i, 0, 1 << k) {
  //   rep(j, 0, 1 << k)
  //     cerr << ve[i][j] << " ";
  //   cerr << endl;
  // }


  int c0 = 0;

  rep(i, 0, 1 << k) {
    if(ve[i][i])
      ++c0;
  }

  int c1 = 0;

  rep(i, 0, 1 << k) {
    rep(j, 0, 1 << k) {
      if(ve[i][j] && ve[j][i])
        ++c1;
    }
  }

  int c2 = 0;

  rep(i, 0, 1 << k) {
    rep(j, 0, 1 << k) {
      if(ve[i][j]) {
        int add = (~ve[i] & ve[j]).count();
        c2 += add;
        debug(i, j, c2, ve[i] == ve[j]);
      }
    }
  }


  cout << c0 << " " << c1 << " " << c2 << endl;
}