// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
import std.exception : enforce;

int n, p;
int[] a;

void main() {
    scan(n, p);
    a = readln.split.to!(int[]);

    auto dp = new long[][](2, 2);
    dp[0][0] = 1L;

    foreach (i, ai; a) {
        i &= 1;
        dp[i ^ 1][0] = dp[i][0] + dp[i][ai & 1];
        dp[i ^ 1][1] = dp[i][1] + dp[i][ai & 1 ^ 1];
    }

    writeln(dp[n & 1][p]);
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}