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\le x_l\le x_r\le x_{max}$), 2 days in a month: $y_l$ and $y_r$ ($1\le y_l\le y_r\le y_{max}$) and 2 seconds in a day: $z_l$ and $z_r$ ($1\le z_l\le z_r\le z_{max}$). The store works at all such moments (month $x$, day $y$, second $z$), when simultaneously $x_l\le x\le x_r$, $y_l\le y\le y_r$ and $z_l\le z\le 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.
The first line contains $6$ integers $x_{max}$, $y_{max}$, $z_{max}$, $n$, $m$, $k$ ($1\le x_{max},y_{max},z_{max}\le 10^5$, $1\le n\le 10^5$, $0\le m\le 10^5$, $1\le k\le 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\le x_i\le x_{max}$, $1\le y_i\le y_{max}$, $1\le z_i\le 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\le x_i\le x_{max}$, $1\le y_i\le y_{max}$, $1\le z_i\le 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\le x_i\le x_{max}$, $1\le y_i\le y_{max}$, $1\le z_i\le z_{max}$) — month, day and second of $i$-th Natasha's query.
def e_store():
    n_m,n_d,n_s,n_c,n_w,n_q=list(map(int,input().split()))
    open_arr=[]
    close_arr=[]
    que_arr=[]
    max_arr=[]
    min_arr=[]
    win_arr=[]
    lose_arr=[]
    col_dim=3
    for q in range(n_c):
        open_arr.append(list(map(int, input().split())))
    for w in range(n_w):
        close_arr.append(list(map(int, input().split())))
    for e in range(n_q):
        que_arr.append(list(map(int, input().split())))
    for x in range(len(open_arr)):
        for y in range(col_dim):
            max_arr.append(open_arr[x][y])
            if len(max_arr)==3:
                win_arr.append(max(max_arr))
                max_arr=[]
    for x1 in range(len(close_arr)):
        for y1 in range(col_dim):
            min_arr.append(close_arr[x1][y1])
            if len(min_arr) == 3:
                lose_arr.append(min(min_arr))
                min_arr = []
    if (open_arr==close_arr):
        print('INCORRECT')
    else:
        print('CORRECT')
        for x2 in range(len(que_arr)):
            if (que_arr[x2]<=win_arr):
                print('OPEN')
            elif(que_arr[x2]>=lose_arr):
                print('CLOSED')
            else:
                print('UNKNOWN')
e_store()
