Problem: Natasha was already going to fly back to Earth when she remembered that she needs to go to the Martian store to buy Martian souvenirs for her friends.

It is known, that the Martian year lasts x_{max} months, month lasts y_{max} days, day lasts z_{max} seconds. Natasha also knows that this store works according to the following schedule: 2 months in a year were selected: x_l and x_r (1≤ x_l≤ x_r≤ x_{max}), 2 days in a month: y_l and y_r (1≤ y_l≤ y_r≤ y_{max}) and 2 seconds in a day: z_l and z_r (1≤ z_l≤ z_r≤ z_{max}). The store works at all such moments (month x, day y, second z), when simultaneously x_l≤ x≤ x_r, y_l≤ y≤ y_r and z_l≤ z≤ z_r.

Unfortunately, Natasha does not know the numbers x_l,x_r,y_l,y_r,z_l,z_r.

One Martian told Natasha: "I went to this store (n+m) times. n times of them it was opened, and m times — closed." He also described his every trip to the store: the month, day, second of the trip and whether the store was open or closed at that moment.

Natasha can go to the store k times. For each of them, determine whether the store at the time of the trip is open, closed, or this information is unknown.

Input

The first line contains 6 integers x_{max}, y_{max}, z_{max}, n, m, k (1≤ x_{max},y_{max},z_{max}≤ 10^5, 1≤ n≤ 10^5, 0≤ m≤ 10^5, 1≤ k≤ 10^5) — number of months in a year, days in a month, seconds in a day, times when the store (according to a Martian) was opened, when it was closed and Natasha's queries.

The i-th of the next n lines contains 3 integers x_i, y_i, z_i (1≤ x_i≤ x_{max}, 1≤ y_i≤ y_{max}, 1≤ z_i≤ z_{max}) — month, day and second of i-th time, when the store, according to the Martian, was opened.

The i-th of the next m lines contains 3 integers x_i, y_i, z_i (1≤ x_i≤ x_{max}, 1≤ y_i≤ y_{max}, 1≤ z_i≤ z_{max}) — month, day and second of i-th time, when the store, according to the Martian, was closed.

The i-th of the next k lines contains 3 integers x_i, y_i, z_i (1≤ x_i≤ x_{max}, 1≤ y_i≤ y_{max}, 1≤ z_i≤ z_{max}) — month, day and second of i-th Natasha's query.

Output

If the Martian was mistaken and his information about when the store is open and when it is closed is inconsistent, print a single line "INCORRECT" (without quotes).

Otherwise, print the first line "CORRECT" (without quotes). Next output k lines: in i-th of them, output an answer to i-th Natasha's query: "OPEN" (without quotes), if the store was opened at the moment of this query, "CLOSED" (without quotes), if it was closed, or "UNKNOWN" (without quotes), if this information can not be determined on the basis of available data.

Examples

Input

10 10 10 3 1 3
2 6 2
4 2 4
6 4 6
9 9 9
3 3 3
10 10 10
8 8 8


Output

CORRECT
OPEN
CLOSED
UNKNOWN


Input

10 10 10 1 1 1
2 5 7
2 5 7
8 9 10


Output

INCORRECT

Note

Consider the first test case.

There are 10 months in a year, 10 days in a month, and 10 seconds in a day.

The store was opened in 3 moments:

  * month 2, day 6, second 2;
  * month 4, day 2, second 4;
  * month 6, day 4, second 6.



The store was closed at the time: month 9, day 9, second 9.

Queries:

  * month 3, day 3, second 3 — open ("OPEN") (since the store opens no later than month 2, day 2, second 2 and closes no earlier than in month 6, day 6, second 6); 
  * month 10, day 10, second 10 — closed ("CLOSED") (since it is closed even in the month 9, day 9, second 9);
  * month 8, day 8, second 8 — unknown ("UNKNOWN") (because the schedule in which the store is open at this moment exists, and the schedule in which the store is closed at this moment exists as well).



In the second test case, the store was closed and opened at the same time — contradiction ("INCORRECT").

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005, INF = 0x3f3f3f3f;
template <size_t N, typename T>
struct Splay_tree {
  Splay_tree() { clear(); }
  struct Node {
    int key;
    T value, sum;
    Node *child[2], *parent;
    inline bool isroot() const {
      return this->parent->child[0] != this && this->parent->child[1] != this;
    }
    inline int dir() const { return this == this->parent->child[1]; }
    inline void maintain() { sum = value + child[0]->sum + child[1]->sum; }
  } * nil, pool[N], *alloc;
  Node* new_Node(int key, T value) {
    Node* ret = alloc++;
    ret->key = key;
    ret->value = ret->sum = value;
    ret->child[0] = ret->child[1] = ret->parent = nil;
    return ret;
  }
  void clear() {
    alloc = pool;
    nil = new_Node(0, 0);
  }
  void rotate(Node* x) {
    int dir = x->dir() ^ 1;
    Node* y = x->parent;
    y->child[dir ^ 1] = x->child[dir];
    x->child[dir]->parent = y;
    x->parent = y->parent;
    if (!y->isroot()) y->parent->child[y->dir()] = x;
    x->child[dir] = y;
    y->parent = x;
    y->maintain();
  }
  void splay(Node* x) {
    for (Node* y; !x->isroot(); rotate(x)) {
      y = x->parent;
      if (!y->isroot()) rotate(x->dir() == y->dir() ? y : x);
    }
    x->maintain();
  }
  Node* get(int k, Node* curr) {
    if (curr == nil) return nil;
    if (k < curr->key)
      return get(k, curr->child[0]);
    else {
      Node* ret = get(k, curr->child[1]);
      return ret == nil ? curr : ret;
    }
  }
  void split(Node* curr, int k, Node*& left, Node*& right) {
    Node* temp = get(k, curr);
    if (temp == nil) {
      left = nil;
      right = curr;
      return;
    }
    splay(temp);
    right = temp->child[1];
    left = temp;
    left->child[1] = right->parent = nil;
    left->maintain();
  }
  Node* merge(Node* left, Node* right) {
    if (left == nil) return right;
    if (right == nil) return left;
    Node* ret = left;
    while (ret->child[1] != nil) ret = ret->child[1];
    splay(ret);
    ret->child[1] = right;
    right->parent = ret;
    ret->maintain();
    return ret;
  }
  void modify(int key, T value, Node*& root) {
    Node *left, *right;
    split(root, key, left, right);
    if (left != nil && left->key == key) {
      left->value = left->value + value;
      left->sum = left->sum + value;
      root = merge(left, right);
      return;
    }
    root = merge(merge(left, new_Node(key, value)), right);
  }
  T query(int l, int r, Node*& root) {
    Node *left, *right, *mid, *temp;
    split(root, l - 1, left, temp);
    split(temp, r, mid, right);
    T ret = (mid == nil ? 0 : mid->sum);
    root = merge(merge(left, mid), right);
    return ret;
  }
  void debug(Node* curr) {
    if (curr == nil) return;
    debug(curr->child[0]);
    printf("%d: %d %d\n", curr->key, curr->value.fi, curr->value.se);
    debug(curr->child[1]);
  }
};
template <size_t N, typename T, typename BinOp>
struct Segment_tree {
  BinOp op;
  Segment_tree(BinOp op = BinOp()) : op(op) { clear(); }
  Splay_tree<N * 20, T> sp;
  typedef typename Splay_tree<N * 20, T>::Node Node;
  Node* seg[N * 4];
  void clear() {
    sp.clear();
    fill(seg, seg + N * 4, sp.nil);
  }
  void modify(int x, int y, T v, int left, int right, int curr) {
    sp.modify(y, v, seg[curr]);
    if (left == right) return;
    int mid = (left + right) / 2;
    if (x <= mid)
      modify(x, y, v, left, mid, curr << 1);
    else
      modify(x, y, v, mid + 1, right, curr << 1 | 1);
  }
  T query(int xl, int xr, int yl, int yr, int left, int right, int curr) {
    if (xl == left && xr == right) {
      return sp.query(yl, yr, seg[curr]);
    }
    int mid = (left + right) / 2;
    if (xr <= mid)
      return query(xl, xr, yl, yr, left, mid, curr << 1);
    else if (xl > mid)
      return query(xl, xr, yl, yr, mid + 1, right, curr << 1 | 1);
    else
      return op(query(xl, mid, yl, yr, left, mid, curr << 1),
                query(mid + 1, xr, yl, yr, mid + 1, right, curr << 1 | 1));
  }
  void debug(int left, int right, int x) {
    printf("[%d %d]: ", left, right);
    if (seg[x] != sp.nil) printf("[%d %d]", seg[x]->sum.fi, seg[x]->sum.se);
    printf("\n");
    if (left == right) return;
    int mid = (left + right) / 2;
    debug(left, mid, x << 1);
    debug(mid + 1, right, x << 1 | 1);
  }
};
template <size_t N, typename T>
using Seg_sum = Segment_tree<N, T, plus<T>>;
int xmax, ymax, zmax, n, m, k;
int xm[2], ym[2], zm[2];
struct Record {
  int fi, se;
  Record() {}
  Record(int x) {
    fi = (x <= zm[1] ? x : 0);
    se = (x >= zm[0] ? x : INF);
  }
  Record(int fi, int se) : fi(fi), se(se) {}
  Record operator+(const Record& rhs) const {
    return Record(max(fi, rhs.fi), min(se, rhs.se));
  }
};
Seg_sum<MAXN, Record> tree;
int main() {
  scanf("%d%d%d%d%d%d", &xmax, &ymax, &zmax, &n, &m, &k);
  xm[0] = xmax, ym[0] = ymax, zm[0] = zmax;
  for (int i = 1; i <= n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    xm[0] = min(xm[0], x);
    xm[1] = max(xm[1], x);
    ym[0] = min(ym[0], y);
    ym[1] = max(ym[1], y);
    zm[0] = min(zm[0], z);
    zm[1] = max(zm[1], z);
  }
  tree.clear();
  for (int i = 1; i <= m; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    if (x >= xm[0] && x <= xm[1] && y >= ym[0] && y <= ym[1] && z >= zm[0] &&
        z <= zm[1]) {
      printf("INCORRECT\n");
      return 0;
    }
    tree.modify(x, y, z, 1, xmax, 1);
  }
  printf("CORRECT\n");
  for (int i = 1; i <= k; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    if (x >= xm[0] && x <= xm[1] && y >= ym[0] && y <= ym[1] && z >= zm[0] &&
        z <= zm[1]) {
      printf("OPEN\n");
      continue;
    }
    bool flag = false;
    for (int j = 0; j < 4; j++) {
      int xl = x, yl = y;
      int xr = xm[j & 1], yr = ym[j >> 1 & 1];
      if (xl > xr) swap(xl, xr);
      if (yl > yr) swap(yl, yr);
      Record rec = tree.query(xl, xr, yl, yr, 1, xmax, 1);
      int zl = min({z, zm[0], zm[1]}), zr = max({z, zm[0], zm[1]});
      if ((rec.fi >= zl && rec.fi <= zr) || (rec.se >= zl && rec.se <= zr)) {
        flag = true;
        break;
      }
    }
    if (flag)
      printf("CLOSED\n");
    else
      printf("UNKNOWN\n");
  }
  return 0;
}