B'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. 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 -t'...