Prefix Suffix Min Max

There is an array $A$ with integer elements of size $n$. We create another array $B$ where $B_{i}$ = $\sum_{j = 1}^{i}A_j$ - $max\{A_1, A_2,...., A_i\}$ You are given this array $B$ and asked to find any valid array $A$. **Note**: For a given array $B$ solution always exists. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test