In SauSaGe City, there are (n) different flavors of sausages. Reyhaneh, the Queen of SauSaGe City, keeps (a_i) ((a_i \lt 16)) sausages of flavor (i) in the royal warehouse. Over time, the royal inventory undergoes (q) updates. Each update is given in the form ((p, x)), which means the number of sausages of flavor (p) in the warehouse is changed to (x) (i.e., (a_p := x)). Reyhaneh can perform the following operation on the sausages any number of times (possibly zero): Choose an index (1 \leq i \lt n) and an integer (1 \leq k \leq 5), then replace (a_i) and (a_{i+1}) with (a_i \oplus (3 \cdot k)) and (a_{i+1} \oplus (3 \cdot k)), respectively, where (\oplus) denotes the bitwise XOR . In SauSaGe City, a sausage flavor is called All-Meat if its quantity is divisible by (3). Three famous sausage critics — Shafi, Shafaghi, and Ghaffari — only like flavors that are All-Meat. Before processing any updates, and after each of the (q) updates, you need to answer the following question: If Reyhaneh performs an arbitrary number of operations optimally, what is the maximum possible number of sausage flavors that the three critics would like? Note: The operations you perform to find the answer for each state are hypothetical and do not affect the array for subsequent queries. However, the (q) inventory updates ((a_p := x)) are permanent. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (q) ((2 \leq n \leq 2 \cdot 10^5), (0 \leq q \leq 2 \cdot 10^5)) — the number of sausage flavors and the number of updates, respectively. The second line contains (n) integers (a_1, a_2, \ldots, a_n) ((0 \leq a_i \lt 16)) — the initial numbers of sausages of each flavor. Then (q) lines follow, each cont