Senorita

There are $N$ bags of biscuits. The $i$-th bag contains $A_i$ biscuits. Shah Rukh will select some of these bags and eat all of the biscuits inside. Here, it is also possible to select all or none of the bags. He would like to select bags so that the total number of biscuits inside is congruent to $P$ modulo $2$. How many such ways to select bags there are? ### Input $N$ $P$ $A_1$ $A_2$ ... $A_N