#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 1e5 + 10;
const int mod = 0;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
template <typename T>
bool chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
};
template <typename T>
bool chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
};
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
void inc(int &a, int b) { a = (a + b >= mod ? a + b - mod : a + b); }
void dec(int &a, int b) { a = (a - b < 0 ? a - b + mod : a - b); }
int x, y, z, n, m, k, xl = inf, xr = -inf, yl = inf, yr = -inf, zl = inf,
                      zr = -inf, cur, ans[N], rt;
struct kdtree {
  int ls, rs, mn[3], mx[3];
} t[N];
struct point {
  int d[3], v;
  bool operator<(const point &b) const { return d[cur] < b.d[cur]; }
} p[N];
void update(int x, int y) {
  for (int i = 0; i < 3; i++)
    chkmin(t[x].mn[i], t[y].mn[i]), chkmax(t[x].mx[i], t[y].mx[i]);
}
int build(int l, int r, int d) {
  cur = d;
  int mid = (l + r) >> 1;
  nth_element(p + l, p + mid, p + r + 1);
  t[mid].ls = t[mid].rs = 0;
  for (int i = 0; i < 3; i++) t[mid].mn[i] = t[mid].mx[i] = p[mid].d[i];
  if (l < mid)
    t[mid].ls = build(l, mid - 1, (d + 1) % 3), update(mid, t[mid].ls);
  if (mid < r)
    t[mid].rs = build(mid + 1, r, (d + 1) % 3), update(mid, t[mid].rs);
  return mid;
}
int lim[3][2];
bool all(int o) {
  for (int i = 0; i < 3; i++)
    if (t[o].mn[i] < lim[i][0] || t[o].mx[i] > lim[i][1]) return 0;
  return 1;
}
bool empty(int o) {
  for (int i = 0; i < 3; i++)
    if (t[o].mx[i] < lim[i][0] || t[o].mn[i] > lim[i][1]) return 1;
  return 0;
}
bool in(int o) {
  for (int i = 0; i < 3; i++)
    if (p[o].d[i] < lim[i][0] || p[o].d[i] > lim[i][1]) return 0;
  return 1;
}
bool query(int o) {
  if (all(o)) return 1;
  if (empty(o)) return 0;
  if (in(o)) return 1;
  if (t[o].ls) {
    if (query(t[o].ls)) return 1;
  }
  if (t[o].rs) {
    if (query(t[o].rs)) return 1;
  }
  return 0;
}
int calc1(int x, int y, int z) {
  int _xl = xl, _xr = xr, _yl = yl, _yr = yr, _zl = zl, _zr = zr;
  chkmin(xl, x);
  chkmax(xr, x);
  chkmin(yl, y);
  chkmax(yr, y);
  chkmin(zl, z);
  chkmax(zr, z);
  lim[0][0] = xl;
  lim[0][1] = xr;
  lim[1][0] = yl;
  lim[1][1] = yr;
  lim[2][0] = zl;
  lim[2][1] = zr;
  int t = !query(rt);
  xl = _xl, xr = _xr, yl = _yl, yr = _yr, zl = _zl, zr = _zr;
  return t;
}
int calc2(int x, int y, int z) {
  if (x < xl || x > xr) return 1;
  if (y < yl || y > yr) return 1;
  if (z < zl || z > zr) return 1;
  return 0;
}
int main() {
  cin >> x >> y >> z >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    x = gi(), y = gi(), z = gi();
    chkmin(xl, x);
    chkmax(xr, x);
    chkmin(yl, y);
    chkmax(yr, y);
    chkmin(zl, z);
    chkmax(zr, z);
  }
  for (int i = 1; i <= m; i++)
    p[i].d[0] = gi(), p[i].d[1] = gi(), p[i].d[2] = gi();
  rt = build(1, m, 0);
  lim[0][0] = xl;
  lim[0][1] = xr;
  lim[1][0] = yl;
  lim[1][1] = yr;
  lim[2][0] = zl;
  lim[2][1] = zr;
  if (n && query(rt)) return puts("INCORRECT"), 0;
  for (int i = 1; i <= k; i++) {
    int x = gi(), y = gi(), z = gi();
    int p = calc1(x, y, z), q = calc2(x, y, z);
    if (!p && !q) return puts("INCORRECT"), 0;
    if (p && q)
      ans[i] = 3;
    else if (p)
      ans[i] = 1;
    else
      ans[i] = 2;
  }
  puts("CORRECT");
  for (int i = 1; i <= k; i++) {
    if (ans[i] == 1)
      puts("OPEN");
    else if (ans[i] == 2)
      puts("CLOSED");
    else
      puts("UNKNOWN");
  }
  return 0;
}
