#include <bits/stdc++.h>
using namespace std;
int n, m, q, m1, ans[1000000], m2, xmi, ymi, zmi, xma, yma, zma;
struct segment_tree {
  int a[1000000];
  void clear(int l, int r, int k) {
    a[k] = 1e9;
    if (l == r) return;
    int mid = (l + r) >> 1;
    clear(l, mid, k << 1);
    clear(mid + 1, r, (k << 1) | 1);
  }
  void update(int l, int r, int k, int x, int y) {
    if (l == r) {
      a[k] = min(a[k], y);
      return;
    }
    int mid = (l + r) >> 1;
    if (x <= mid) update(l, mid, k << 1, x, y);
    if (x > mid) update(mid + 1, r, (k << 1) | 1, x, y);
    a[k] = min(a[k << 1], a[(k << 1) | 1]);
  }
  int find(int l, int r, int k, int x, int y) {
    if (l >= x && r <= y) return a[k];
    int mid = (l + r) >> 1, ans = 1e9;
    if (x <= mid) ans = find(l, mid, k << 1, x, y);
    if (y > mid) ans = min(ans, find(mid + 1, r, (k << 1) | 1, x, y));
    return ans;
  }
} st;
struct arr {
  int p, x, y, z;
} p[300005], p1[300005];
bool cmp(arr x, arr y) {
  if (x.x != y.x) return x.x < y.x;
  return x.p < y.p;
}
int check(int bo, int x, int l, int r) {
  if (!bo) return max(-1, x - l);
  return max(-1, r - x);
}
int main() {
  scanf("%*d%*d%*d%d%d%d", &n, &m, &q);
  xmi = ymi = zmi = 1e9;
  for (int i = 1; i <= n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    xma = max(xma, x);
    xmi = min(xmi, x);
    yma = max(yma, y);
    ymi = min(ymi, y);
    zma = max(zma, z);
    zmi = min(zmi, z);
  }
  for (int i = 1; i <= m; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    if (x >= xmi && x <= xma && y >= ymi && y <= yma && z >= zmi && z <= zma) {
      puts("INCORRECT");
      return 0;
    }
    p[++m1] = {0, x, y, z};
  }
  puts("CORRECT");
  for (int i = 1; i <= q; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    if (x >= xmi && x <= xma && y >= ymi && y <= yma && z >= zmi && z <= zma)
      ans[i] = 2;
    else
      p[++m1] = {i, x, y, z};
  }
  for (int x = 0; x <= 1; x++)
    for (int y = 0; y <= 1; y++)
      for (int z = 0; z <= 1; z++) {
        m2 = 0;
        for (int i = 1; i <= m1; i++) {
          int xx = check(x, p[i].x, xmi, xma);
          if (xx == -1) continue;
          int yy = check(y, p[i].y, ymi, yma);
          if (yy == -1) continue;
          int zz = check(z, p[i].z, zmi, zma);
          if (zz == -1) continue;
          p1[++m2] = {p[i].p, xx + 1, yy + 1, zz + 1};
        }
        st.clear(1, 100005, 1);
        sort(p1 + 1, p1 + m2 + 1, cmp);
        for (int i = 1; i <= m2; i++)
          if (p1[i].p)
            ans[p1[i].p] |= st.find(1, 100005, 1, 1, p1[i].y) <= p1[i].z;
          else
            st.update(1, 100005, 1, p1[i].y, p1[i].z);
      }
  for (int i = 1; i <= q; i++)
    if (ans[i] & 1)
      puts("CLOSED");
    else {
      if (ans[i])
        puts("OPEN");
      else
        puts("UNKNOWN");
    }
  return 0;
}
