Tournament Rigging (Minimum)

*This problem has the same setup as `KUPSET`. The only difference is that here, you only need to minimize the number of upsets in the tournament.* --- You are given two integers $N$ and $W$. Construct any array $A$ of length $2^{N+1}-1$ satisfying the following properties: 1. $A_1 = W$. 2. For each $1 \le i \lt 2^N$, either $A_i = \max(A_{2i}, A_{2i+1})$ or $A_i = \min(A_{2i}, A_{2i+1})$. 3. T