Fixed Sum

You are given two integers $N \ ( N \geq 2)$ and $S$. You have to construct an array $A$ containing $N$ integers such that: - $0 \leq A_i \leq S$ for each $1 \leq i \leq N$ - $A_1 + A_2 + \ldots + A_N = S$ - $A_1 \mathbin{\&} A_2 \mathbin{\&} \ldots \mathbin{\&} A_N = 0$, where $\mathbin{\&}$ denotes [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) operator. - The maximum element