P5913 [POI 2004] KAG


The first line contains an integer $k$, indicating there are $k$ test cases. For each test case, it starts with two integers $n$ and $m$. Then follow $m$ lines, each containing two integers describing an edge.

Output a total of $k$ lines. For each line, output one decision: if the graph is c-algae, output `TAK`; otherwise, output `NIE`.

For $100\%$ of the testdata, $1\le k\le10$, $1\le n\le10^4$, $0\le m\le10^5$. Translated by ChatGPT 5