The rapidly growing popularity of Bytean chess is the reason why many different variants of this game have been invented. Because the traditional version is played on an infinite chessboard, what can be quite troublesome, sometimes simpler variants are chosen, in which the dimensions of the chessboards are bounded by 100000 * 100000. Some squares of the chessboard are black and the remaining ones are white, however the painting pattern depends on the particular chessboard. A pawn moves on such a chessboard in a bit different way than in traditional chess - it can move horizontally, vertically or diagonally to any of the adjacent eight squares provided that this square has the same colour as the square currently occupied by the pawn.

Examples of valid moves.

For given pairs of squares on the chessboard it should be determined whether a pawn can travel between these squares.

Input

The first line of the standard input contains three integers n, m and P (1 ≤ n ≤ 100000, 1 ≤ m ≤ 1000000, 1 ≤ p ≤ 1000) separated by single spaces and representing the size of the chessboard, the number of black fragments of the chessboard described in the input, and the number of queries, respectively. The chessboard has dimensions n*n and consists of squares with both coordinates between 1 and n. The following m lines contain descriptions of black fragments of the chessboard (they do not necessarily need to be disjoint). Each one of them consists of three integers w_i, k_i,1 and k_i,2 (1 ≤ w_i ≤ n, 1 ≤ k_i,1 ≤ k_i,2 ≤ n) separated by single spaces and meaning that in row w_i squares in columns between k_i,1 and k_i,2 are black. The squares that are not contained in any dark fragment specified in the input are white.

The following P lines contain the queries. Each query consists of two pairs of integers a_i,1, b_i,1, a_i,2, b_i,2 (1 ≤ a_i,1, b_i,1, a_i,2, b_i,2 ≤ n) separated by single spaces. The query is: can a pawn get from the square in row a_i,1 and column b_i,1 to the square in row a_i,2 and column b_i,2?

Output

Your program should output P lines to the standard output: the answers to the respective queries, in the same order as they appear in the input. The answer to each query is a line with a word "TAK" (meaning YES) or "NIE" (meaning NO) without the quotes, depending on whether a pawn can get from the first of the specified squares to the second one without passing through a square with different colour.

Example

For the input data:

4 5 2
1 1 1
2 3 4
3 2 2
4 2 2
4 2 2
1 1 3 2
1 2 4 4

the correct result is:

NIE
TAK

The chessboard and the queries from the example.

Task author: Krzysztof Diks.