#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>

using std::string;
using std::vector;
using std::set;
using std::multiset;
using std::unordered_set;
using std::map;
using std::multimap;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;

using boost::multiprecision::cpp_int;
using cpp_dec_float_1000 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000, boost::int128_type>>;

typedef uintmax_t    ull;
typedef intmax_t     ll;
typedef uint64_t     ul;
typedef uint32_t     ui;
typedef uint8_t      uc;

constexpr char CRLF  = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
constexpr int MOD = 1000'000'007;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
template<class T> T modinv(T a, T m) { T b = m, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; boost::swap(a, b); u -= t * v; boost::swap(u, v); } u %= m; if (u < 0) u += m; return u; }
template<class T> inline bool isSosuu(const T& n) { if (n == T(1)) { return false; } for (T i = 2; i*i <= n; ++i) { if (n % i == 0) { return false; } } return true; }
template<class T> vector<vector<T>> split (const vector<T>& S, T delim) { vector<vector<T>> ret{}; vector<T> buff{}; for (auto c : S) { if (c == delim) { if (!buff.empty()) ret.push_back(buff); buff.clear(); } else { buff.push_back(c); } } if (!buff.empty()) ret.push_back(buff); return ret; }
template<class T> inline void printYesNo(const T& t) { cout << (t ? "Yes" : "No") << CRLF; }
template<class T = int64_t> T modpow(T N, T P, T M) { T ret{1}; N %= M; while (P) { if (P & 0x01) { ret *= N; ret %= M; } P >>= 1; N *= N; N %= M; } return ret; }

/** code for assert debug begin */
int gErr = 0;
#define ASSERT(p) if(!(p)){ gErr = 1; }else{ ; }
/** code for assert debug end */

template<typename T = int64_t>
struct Combination
{
public:

  /** 符号付き整数を推奨 */
  using com_int = T;

  int N;

  vector<vector<com_int>> memo;

  /**
   * @param N nCkで指定するnの最大
   */
  Combination(int N)
    : N(N)
    , memo(N+1, vector<com_int>(N+1, com_int(-1)))
  {}

  /**
   * 二項係数を計算する
   * @param n
   * @param k
   * @return nCk (mod m)
   */
  com_int operator()(int n, int k) {
    if (n < k) {
      return com_int(0);
    }
    if (n < 0 || k < 0) {
      return com_int(0);
    }
    if (n > N) {
      throw std::runtime_error("nが大きすぎる");
    }    
    return rec(n, k);
  }

private:
  com_int rec(int n, int k) {
    if (k * 2 > n) { k = n - k; }
    if (memo[n][k] != -1) {
      return memo[n][k];
    }
    if (k == 0) {
      return memo[n][k] = 1;
    }
    if (n == 0) {
      return memo[n][k] = 0;
    }
    if (k == 1) {
      return memo[n][k] = n;
    }
    return memo[n][k] = rec(n - 1, k) + rec(n - 1, k - 1);
  }
};

void solve(void)
{
  int N, P; cin >> N >> P;
  vector<int> A(N);
  for (auto& a : A) { cin >> a; }

  auto oddCount = boost::count_if(A, [](auto a){ return a % 2 == 1; });
  auto evenCount = boost::count_if(A, [](auto a){ return a % 2 == 0; });
  Combination<> comb(N+1);

  if (P) {
    // odd
    ll evenRes{};
    for (int i = 1; i <= evenCount; ++i) {
      evenRes += comb(evenCount, i);
    }

    ll oddRes{};
    for (int i = 1; i <= oddCount; i += 2) {
      oddRes += comb(oddCount, i);
    }
    auto ans = (evenRes + 1) * oddRes;
    cout << ans << CRLF;

  } else {
    // even
    ll evenRes{};
    for (int i = 1; i <= evenCount; ++i) {
      evenRes += comb(evenCount, i);
    }

    ll oddRes{};
    for (int i = 2; i <= oddCount; i += 2) {
      oddRes += comb(oddCount, i);
    }
    auto ans = evenRes + oddRes + evenRes * oddRes + 1;
    cout << ans << CRLF;
  }
  return;
}

int main(void)
{
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);

  solve();

  return 0;
}


Measured memory_bytes: 256