Bytie found a strange document among his mail today. It was a notification that he had inherited a gigantic amount of money after his uncle Byteasar. The document has multiple impressions of the Seal of the Kingdom of Byteotia. Just in case though, Bytie would like to make sure that this is not a scam. To this end, he wants to determine if these are impressions of the legitimate seal.

Bytie knows very well how the Seal of the Kingdom of Byteotia looks. However, there is so much ink on the document he received that it is hard to tell if an overzealous clerk made multiple impressions or if it is a feeble attempt to fool Bytie. Help Bytie by writing a program that, given the impressions on the document and the matrix of the Seal of the Kingdom of Byteotia, determines if the impressions on the document are legitimate.

The Seal of the Kingdom of Byteotia has complex security measures that prevent all of the following: (1) rotating the seal impression, (2) making a seal impression whose part does not appear on the document, and (3) inking any point of the document with more than one seal impression.

Input

In the first line of the standard input, there is a single integer $q$ ($1 \le q \le 10$), specifying the number of data sets. The lines that follow describe successive data sets.

In the first line of a single data set description, there are four integers, $n, m, a,$ and $b$ ($1 \le n, m, a, b \le 1000$), separated by single spaces.

The following $n$ lines describe the impressions on the document. Each of these lines contains $m$ characters, each of which is either . (dot) or x. The dot signifies that there is no ink at the respective position of the document, whereas x signifies a trace of ink.

Next, a sample document with a single impression of the Kingdom of Byteotia seal is described, in the same format as the one used for the document received by Bytie, in $a$ lines of $b$ characters, . or x each. You may assume that both impressions, from Bytie’s document and the legitimate seal matrix, contain a trace of ink.

In tests worth 44% of the total score, it holds that $n, m, a, b \le 150$.

Output

Your program should print exactly $q$ lines to the standard output. The $i$-th of these lines should provide the answer for the $i$-th data set.

If the document received by Bytie could have been imprinted with the legitimate seal, the answer for the data set should be a single word TAK (Polish for yes). If, on the other hand, the document is a forgery, the answer should be the word NIE (Polish for no).

Examples

Input 1

2
3 4 4 2
xx..
.xx.
xx..
x.
.x
x.
..
2 2 2 2
xx
xx
.x
x.

Output 1

TAK
NIE

Note

Sample grading tests:

• 1ocen: Single data set: document of size $2 \times 3$, completely covered with ink, seal matrix of size $1 \times 2$. Answer: NIE.
• 2ocen: Single data set: document is a checkerboard of size $8 \times 8$; seal matrix is a checkerboard of size $3 \times 3$. Answer: NIE.
• 3ocen: $q = 10$, all the data sets satisfy the following: a random seal matrix of size $20 \times 20$ and a document of size $1000 \times 1000$ with a single impression of the seal. All answers: TAK.