Min Ops (Easy)

**This is the easy version of the problem. All the constraints in this problem are smaller. Notably, $N, Q, A_i, K \le 30$.** Given an array $B$ of length $M$, consider the following operation on it: - Choose $L$ and $R$ such that: - $1 \le L \le R \le M$ - $B_i = B_L$ for all $L \le i \le R$ - $L = 1$ or $B_L \neq B_{L-1}$ - $R = M$ or $B_R \neq B_{R+1}$ - Then, do one of the fol