Sum Operations (Easy)

**This is the easy version of the problem. It is worth $25$ points in division $1$, and $100$ points in all other divisions.** For an array $B$ of length $M$, you are allowed to perform the following operation as many times as required: * Let $S = \sum\limits_{i=1}^M{B_i}$ * Pick $i$ such that $1 \leq i \leq \min(M,|S|)$ * Either increment or decrement $B_i$ by $1$ Define $f(B)$ to be the minimu