XxOoRr

Given an array $A_1, A_2 \ldots A_N$, find the minimum number of operations (possibly zero) required to convert all integers in $A$ to $0$. In one operation, you - choose a non-negative integer $p$ ($p \geq 0$), - select at most $K$ indices in the array $A$, and - for each selected index $i$, replace $A_i$ with $A_i\oplus 2^p$. Here, $\oplus$ denotes bitwise XOR. ### Subtasks - **Subtask #1 (100