Minimize Sum

You have an array $A$ of $N$ integers, and an integer $M$ such that $0 \le A_i < M$. You can do the following operation as many times as you want: - Set $A_i = (A_i + 1) \mod M$ for **all indices** $i$ ($1 \le i \le N$). Find the minimum possible sum of the array $A$ after doing the above operation some number of times. ### Input - The first line of input will contain a single integer $T$, den