Bitwise Tuples

Chef has two numbers $N$ and $M$. Help Chef to find number of integer $N$-tuples $(A_1, A_2, \ldots, A_N)$ such that $0 \leq A_1, A_2, \ldots, A_N \leq 2^M - 1$ and $A_1 \& A_2 \& \ldots \& A_N = 0$, where $\&$ denotes the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) operator. Since the number of tuples can be large, output it modulo $10^9+7$. ### Input - The first line co