Chef And Array Construction

Given two positive integers $N$ and $M$, let $S$ denote the set of all the arrays of size $N$ such that each element of the array lies in the range $[1, M]$. Since there are $M^N$ such arrays, the size of $S$ is $M^N$. Let $X_i$ denote the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of all elements of the $i^{th}$ array in the set, where $1 \le i \le M^N$. Find the value