{"raw_statement":[{"iden":"statement","content":"Adnan is training the ARC team in NCD, but he wants to challenge them, so he started burning their drivers.\n\nThe team has $N$ drivers. Each driver has a lowercase Latin letter written on it. A segment of drivers from $L$ to $R$ can be used to move the robot if this segment is palindrome. When Adnan burns a driver, he changes the letter to any other letter he wants.\n\nA segment of letters is considered palindrome if it can be read the same way from right and left. For example, $a a$, $a b c b a$, and $m m m$ are palindromes. But $m m a$ and $a a m a$ aren't.\n\nYou will be given $E$ events in order; these events are of two kinds:\n\n$1$ $i$ $c$: Adnan will burn the $i_{t h}$ driver to change its letter to the char $c$.\n\n$2$ $l$ $r$: The ARC team will use the segment [$l$,$r$], print \"Adnan Wins\" if this segment is palindrome, and \"ARCNCD!\" otherwise.\n\nFirst line of input will be $T$, number of test cases\n\nEach test case begins with two numbers $N, E$ the number of drivers, and the number of events. \n\nFollowed by a string of length $N$ consisting of only lowercase Latin letters.\n\nNext $E$ lines contains $3$ space separated integers, the queries as described above.\n\n$1 <= N, E <= 10^5$\n\nIt's guaranteed there is at least one query of the second type.\n\nFor every query of the second type, print \"Adnan Wins\" or \"ARCNCD!\"\n\n"},{"iden":"input","content":"First line of input will be $T$, number of test casesEach test case begins with two numbers $N, E$ the number of drivers, and the number of events. Followed by a string of length $N$ consisting of only lowercase Latin letters.Next $E$ lines contains $3$ space separated integers, the queries as described above.$1 <= N, E <= 10^5$It's guaranteed there is at least one query of the second type."},{"iden":"output","content":"For every query of the second type, print \"Adnan Wins\" or \"ARCNCD!\""}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case:  \n- Let $ N, E \\in \\mathbb{Z} $ denote the number of drivers and number of events.  \n- Let $ S = s_1 s_2 \\dots s_N $ be a string of length $ N $, where $ s_i \\in \\{a, b, \\dots, z\\} $ represents the letter on driver $ i $.  \n- Let $ Q = \\{q_1, q_2, \\dots, q_E\\} $ be a sequence of $ E $ events, where each $ q_j $ is one of:  \n  - Type 1: $ (1, i, c) $ — update $ s_i \\leftarrow c $,  \n  - Type 2: $ (2, l, r) $ — query whether substring $ s[l:r] $ is a palindrome.  \n\n**Constraints**  \n1. $ 1 \\le T \\le 10 $ (implied by constraints, though not explicitly bounded; standard assumption)  \n2. $ 1 \\le N, E \\le 10^5 $  \n3. For all updates: $ 1 \\le i \\le N $, $ c \\in \\{a, b, \\dots, z\\} $  \n4. For all queries: $ 1 \\le l \\le r \\le N $  \n\n**Objective**  \nFor each query $ (2, l, r) $:  \nOutput \"Adnan Wins\" if $ s_l s_{l+1} \\dots s_r $ is a palindrome, i.e.,  \n$$\n\\forall k \\in \\{0, 1, \\dots, r-l\\}, \\quad s_{l+k} = s_{r-k}\n$$  \nOtherwise, output \"ARCNCD!\".","simple_statement":"You are given a string of N lowercase letters and E events. Two types of events:\n\n1. Change the letter at position i to c.\n2. Check if the substring from l to r is a palindrome. If yes, print \"Adnan Wins\"; otherwise, print \"ARCNCD!\".","has_page_source":false}