In the event of technical difficulties with Szkopuł, please contact us via email at email@example.com.
If you are familiar with IRC chat, the support team is also reachable on PIRC network (
#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.
C-algae is the Byteotians' favourite dish of their national cuisine. C-algae have a very specific structure. An algae consisting of a single cell is a c-algae. Two c-algae and , can be combined in either one of the following ways:
As a result we obtain a new c-algae .
Unfortunately the hostile country of Bitotia has recently started selling algae imitating c-algae. These look so alike that it is hard to tell the difference between a false one and a genuine c-algae. This is the reason why the Byteotian government has asked you to write a programme that would allow verification if a given algae is a c-algae.
Write a programme that:
In the first line of the standard input a single integer is written, , it denotes the number of algae to be examined. Descriptions of algae are written in the following lines. Each single description is of the following form: in the first line there are two integers written, separated by a single space, and , , . They denote the number of cells and the number of connections respectively. The cells are numbered from to . In the following lines the connections are described - each by two integers , , separated by a single space (, ), indicating that the cells and are connected. Each connection is specified once.
lines should be written to the standard output. In the 'th line one word should be written:
For the input data:
3 3 2 1 2 2 3 4 3 1 2 2 3 3 4 3 3 1 2 2 3 3 1
the correct result is:
TAK NIE TAK
Task author: Tomasz Walen.