{"raw_statement":[{"iden":"problem statement","content":"There are $N$ bags of biscuits. The $i$\\-th bag contains $A_i$ biscuits.\nTakaki 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.\nHe 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?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 50$\n*   $P = 0$ or $1$\n*   $1 \\leq A_i \\leq 100$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $P$\n$A_1$ $A_2$ ... $A_N$"},{"iden":"sample input 1","content":"2 0\n1 3"},{"iden":"sample output 1","content":"2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to $0$ modulo $2$:\n\n*   Select neither bag. The total number of biscuits is $0$.\n*   Select both bags. The total number of biscuits is $4$."},{"iden":"sample input 2","content":"1 1\n50"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"3 0\n1 1 1"},{"iden":"sample output 3","content":"4\n\nTwo bags are distinguished even if they contain the same number of biscuits."},{"iden":"sample input 4","content":"45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26"},{"iden":"sample output 4","content":"17592186044416"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}