#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 5001;
int n, m;
bitset<1000> arr[maxn];
map<string, int> to;
bitset<1000> minv, maxv;
pair<pair<int, int>, int> v[maxn];
void output(bitset<1000> &r) {
  for (int i = 0; i < m; i++) {
    if (r.test(i))
      printf("1");
    else
      printf("0");
  }
  puts("");
}
int getsum(int pos, int cate) {
  int sum = 0;
  for (int i = 0; i < n; i++) {
    if (v[i].second != -1) {
      int a = arr[v[i].first.first].test(pos);
      int b = arr[v[i].first.second].test(pos);
      if (v[i].first.first == n) a = cate;
      if (v[i].first.second == n) b = cate;
      int op = v[i].second;
      int rc = 0;
      if (op == 0)
        rc = a & b;
      else if (op == 1)
        rc = a | b;
      else
        rc = a ^ b;
      sum += rc;
      arr[i].set(pos, rc);
    } else
      sum += arr[i].test(pos);
  }
  return sum;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  memset(v, -1, sizeof(v));
  string strline;
  getline(cin, strline);
  to["?"] = n;
  for (int i = 0; i < n; i++) {
    getline(cin, strline);
    istringstream is(strline);
    string no, temp;
    is >> no;
    to[no] = i;
    is >> temp >> temp;
    if (temp[0] == '0' || temp[0] == '1') {
      for (int j = 0; j < m; j++) arr[i].set(j, temp[j] - '0');
    } else {
      string a, op, b;
      a = temp;
      is >> op >> b;
      int cate = 0, noa = to[a], nob = to[b];
      if (op == "OR")
        cate = 1;
      else if (op == "XOR")
        cate = 2;
      v[i] = make_pair(make_pair(noa, nob), cate);
    }
  }
  for (int i = 0; i < m; i++) {
    int va = getsum(i, 0), vb = getsum(i, 1);
    if (va > vb) {
      maxv.set(i, 0);
      minv.set(i, 1);
    } else {
      if (va == vb)
        maxv.set(i, 0);
      else
        maxv.set(i, 1);
      minv.set(i, 0);
    }
  }
  output(minv);
  output(maxv);
  return 0;
}
