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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author kessido
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EStore solver = new EStore();
        solver.solve(1, in, out);
        out.close();
    }

    static class EStore {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int[] maxs = in.NextIntArray(3);
            int n = in.NextInt();
            int m = in.NextInt();
            int k = in.NextInt();
            Box box = new Box(maxs);
            for (int i = 0; i < n; i++) {
                box.addPoint(in.NextIntArray(3));
            }
            int[][] pointsOutside = in.NextIntMatrix(m, 3);
            for (int[] p : pointsOutside) {
                if (box.isInside(p)) {
                    out.println("INCORRECT");
                    return;
                }
            }
            int[][] maxBox = new int[3][2];
            for (int i = 0; i < 3; i++) {
                maxBox[i][1] = maxs[i];
            }
            Oct3Tree octtree = new Oct3Tree(Arrays.asList(pointsOutside));
            out.println("CORRECT");
            int[][] queryBox = new int[3][2];
            for (int i = 0; i < k; i++) {
                int[] p = in.NextIntArray(3);
                if (box.isInside(p)) {
                    out.println("OPEN");
                    continue;
                }
                for (int j = 0; j < 3; j++) {
                    queryBox[j][0] = box.box[j][0];
                    queryBox[j][1] = box.box[j][1];
                    queryBox[j][0] = Math.min(queryBox[j][0], p[j]);
                    queryBox[j][1] = Math.max(queryBox[j][1], p[j]);
                }

                boolean hasInRange = octtree.hasInRange(queryBox);
                if (!hasInRange) {
                    out.println("UNKNOWN");
                } else {
                    out.println("CLOSED");
                }
            }

        }

        class Box {
            int[][] box = new int[3][2];

            public Box(int[] max) {
                for (int i = 0; i < 3; i++) {
                    box[i][0] = max[i];
                }
            }

            public Box(Box box) {
                for (int i = 0; i < 3; i++) {
                    for (int j = 0; j < 2; j++) {
                        this.box[i][j] = box.box[i][j];
                    }
                }
            }

            public void addPoint(int[] p) {
                for (int i = 0; i < 3; i++) {
                    box[i][0] = Math.min(box[i][0], p[i]);
                    box[i][1] = Math.max(box[i][1], p[i]);
                }
            }

            public boolean isInside(int[] p) {
                for (int i = 0; i < 3; i++) {
                    if (!(box[i][0] <= p[i] && p[i] <= box[i][1])) {
                        return false;
                    }
                }
                return true;
            }


            public Box clone() {
                return new Box(this);
            }

        }

    }

    static interface IDTreeInt {
    }

    static interface IPersistenceDTreeInt extends IDTreeInt {
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine(), " \t\n\r\f,");
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int NextInt() {
            return Integer.parseInt(next());
        }

        public int[] NextIntArray(int n) {
            return NextIntArray(n, 0);
        }

        public int[] NextIntArray(int n, int offset) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = NextInt() + offset;
            }
            return a;
        }

        public int[][] NextIntMatrix(int n, int m) {
            return NextIntMatrix(n, m, 0);
        }

        public int[][] NextIntMatrix(int n, int m, int offset) {
            int[][] a = new int[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    a[i][j] = NextInt() + offset;
                }
            }
            return a;
        }

    }

    static class Oct3Tree implements IDTreeInt, IPersistenceDTreeInt {
        int[][] box = new int[3][3];
        int count;
        Oct3Tree[] children = new Oct3Tree[8];

        public Oct3Tree(Collection<int[]> points) {
            //Using this constructor imply no update!!
            count = points.size();
            for (int i = 0; i < 3; i++) {
                box[i][0] = Integer.MAX_VALUE;
                box[i][2] = Integer.MIN_VALUE;
            }
            for (int[] p : points) {
                for (int i = 0; i < 3; i++) {
                    box[i][0] = Math.min(box[i][0], p[i]);
                    box[i][2] = Math.max(box[i][2], p[i]);
                }
            }
            if (!needToSplit()) return;
            ArrayList[] pointDivision = new ArrayList[8];
            for (int i = 0; i < 8; i++)
                pointDivision[i] = new ArrayList();
            for (int[] p : points) {
                pointDivision[getPointIndex(p)].add(p);
            }
            for (int i = 0; i < 8; i++) {
                if (pointDivision[i].size() != 0) {
                    children[i] = new Oct3Tree(pointDivision[i]);
                }
            }
        }

        public Oct3Tree(Oct3Tree octTree) {
            this.box = octTree.box;
            this.count = octTree.count;
            this.children = octTree.children;
        }

        private boolean needToSplit() {
            boolean needToSplit = false;
            for (int i = 0; i < 3; i++) {
                box[i][1] = (box[i][0] + box[i][2]) / 2;
                needToSplit |= box[i][0] != box[i][2];
            }
            return needToSplit;
        }

        public Oct3Tree(int[][] box) {
            for (int i = 0; i < 3; i++) {
                this.box[i][0] = box[i][0];
                this.box[i][2] = box[i][1];
                this.box[i][1] = (this.box[i][0] + this.box[i][2]) / 2;
            }
            this.count = 0;
        }

        private int getPointIndex(int[] p) {
            int res = 0;
            for (int i = 0; i < 3; i++) {
                if (p[i] > box[i][1]) {
                    res |= 1 << i;
                }
            }
            return res;
        }

        private boolean completelyInside(int[][] boxQuery) {
            for (int i = 0; i < 3; i++) {
                if (!(boxQuery[i][0] <= box[i][0] && box[i][2] <= boxQuery[i][1])) {
                    return false;
                }
            }
            return true;
        }

        private boolean someIntersection(int[][] boxQuery) {
            for (int i = 0; i < 3; i++) {
                if (boxQuery[i][0] > box[i][2] || box[i][0] > boxQuery[i][1]) {
                    return false;
                }
            }
            return true;
        }


        public boolean hasInRange(int[][] boxQuery) {
            if (completelyInside(boxQuery))
                return count != 0;
            else if (someIntersection(boxQuery))
                return hasInChildrenRange(boxQuery);
            else
                return false;

        }

        private boolean hasInChildrenRange(int[][] boxQuery) {
            for (int i = 0; i < 8; i++) {
                if (children[i] != null) {
                    if (children[i].hasInRange(boxQuery)) {
                        return true;
                    }
                }
            }
            return false;
        }

    }
}