In the event of technical difficulties with Szkopuł, please contact us via email at [email protected].

If you are familiar with IRC chat, the support team is also reachable on PIRC network (`irc.pirc.pl`

) in `#szkopul`

channel. If you are not, just use email.

Please do not ask us things like "how to solve task XYZ?".

Please remember that the support team has to sleep sometimes or go to work in real life.

One of the tasks in the Byteotian Intelligence Test (BIT) is to cross out numbers from an initial sequence in such a way that leaves as a result certain given sequences. Byteasar longs to become the IQ Master of Byteotia, but he is no good in this kind of tasks. But since practice makes perfect, he intends to practise a lot. So much in fact that he asks you to write a program that will facilitate the training by verifying his answers quickly.

The first line of the standard input contains one integer (). The second line holds integers ( for ), separated by single spaces, that constitute the initial sequence of the test. The third line of the input holds one integer . The following lines describe the sequences to be obtained by crossing out numbers from the initial sequence. Each sequence's description takes two successive lines. The first of these two lines contains an integer (). The second contains an -element long sequence of integers ( for ) separated by single spaces. You may assume that the total length on given sequences does not exceed .

Your program should print out lines to the standard output.
The -th line (for ) should hold one word,
"`TAK`" (*yes* in Polish) if the -th input sequence can be obtained by
crossing out (i.e., removing) some, not necessarily contiguous, numbers from the initial sequence,
or "`NIE`" (*no* in Polish) otherwise. Mind you, only the words should be printed,
no quotation marks. Of course, the order of the numbers left after crossing out is important,
as can be seen in the example.

For the input data:

7 1 5 4 5 7 8 6 4 5 1 5 5 8 6 3 2 2 2 3 5 7 8 4 1 5 7 4

the correct result is:

TAK NIE TAK NIE

*Task author: Jakub Radoszewski.*