#include <bits/stdc++.h>
using namespace std;
int number(string &S, int x, int y, int &p){
  char c = S[p];
  p++;
  if (c == 'x'){
    return x;
  }
  if (c == 'y'){
    return y;
  }
  if (c == '0'){
    return 0;
  }
  if (c == '1'){
    return 1;
  }
}
int expr(string &S, int x, int y, int &p);
int term(string &S, int x, int y, int &p){
  int neg = 0;
  while (S[p] == '!'){
    neg ^= 1;
    p++;
  }
  if (S[p] == '('){
    p++;
    int ans = expr(S, x, y, p);
    p++;
    return ans ^ neg;;
  } else {
    return number(S, x, y, p) ^ neg;
  }
}
int expr_eq(string &S, int x, int y, int &p){
  int ans = term(S, x, y, p);
  while (S[p] == '='){
    p++;
    int ans2 = term(S, x, y, p);
    ans = ans == ans2;
  }
  return ans;
}
int expr_and(string &S, int x, int y, int &p){
  int ans = expr_eq(S, x, y, p);
  while (S[p] == '&'){
    p++;
    int ans2 = expr_eq(S, x, y, p);
    ans = ans & ans2;
  }
  return ans;
}
int expr_or(string &S, int x, int y, int &p){
  int ans = expr_and(S, x, y, p);
  while (S[p] == '|'){
    p++;
    int ans2 = expr_and(S, x, y, p);
    ans = ans | ans2;
  }
  return ans;
}
int expr(string &S, int x, int y, int &p){
  int ans = expr_or(S, x, y, p);
  while (S[p] == '^'){
    p++;
    int ans2 = expr_or(S, x, y, p);
    ans = ans ^ ans2;
  }
  return ans;
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  vector<int> a(n), b(n);
  vector<string> s(n);
  vector<int> r(n + 1);
  for (int i = 0; i < n; i++){
    cin >> a[i] >> b[i] >> s[i] >> r[i];
    a[i]--;
    b[i]--;
  }
  cin >> r[n];
  vector<vector<array<array<int, 2>, 2>>> A(k, vector<array<array<int, 2>, 2>>(k));
  for (int i = 0; i < k; i++){
    for (int j = 0; j < k; j++){
      for (int l = 0; l < 2; l++){
        for (int m = 0; m < 2; m++){
          A[i][j][l][m] = n;
        }
      }
    }
  }
  for (int i = n - 1; i >= 0; i--){
    for (int j = 0; j < 2; j++){
      for (int l = 0; l < 2; l++){
        int p = 0;
        if (expr(s[i], j, l, p) == 1){
          A[a[i]][b[i]][j][l] = i;
        }
      }
    }
  }
  vector<vector<int>> f(1 << k, vector<int>(1 << k, 0));
  for (int i = 0; i < (1 << k); i++){
    for (int j = 0; j < (1 << k); j++){
      int mn = n;
      for (int l = 0; l < k; l++){
        for (int m = 0; m < k; m++){
          mn = min(mn, A[l][m][i >> l & 1][j >> m & 1]);
        }
      }
      f[i][j] = r[mn];
    }
  }
  int ans1 = 0;
  for (int i = 0; i < (1 << k); i++){
    if (f[i][i] == 1){
      ans1++;
    }
  }
  int ans2 = 0;
  for (int i = 0; i < (1 << k); i++){
    for (int j = 0; j < (1 << k); j++){
      if (f[i][j] == 1 && f[j][i] == 1){
        ans2++;
      }
    }
  }
  int ans3 = 0;
  vector<bitset<1024>> B1(1 << k), B2(1 << k);
  for (int i = 0; i < (1 << k); i++){
    for (int j = 0; j < (1 << k); j++){
      if (f[i][j] == 1){
        B1[i].set(j);
        B2[j].set(i);
      }
    }
  }
  for (int i = 0; i < (1 << k); i++){
    for (int j = 0; j < (1 << k); j++){
      if (f[i][j] == 0){
        ans3 += (B1[i] & B2[j]).count();
      }
    }
  }
  cout << ans1 << ' ' << ans2 << ' ' << ans3 << endl;
}