#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, K;
  cin >> n >> K;
  long long a[n];
  long long sum[n + 1];
  sum[0] = 0;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    sum[i + 1] = sum[i] + a[i];
  }
  vector<long long> ans;
  for (long long i = 0; i < n + 1; i++) {
    for (long long j = i + 1; j < n + 1; j++) {
      ans.push_back(sum[j] - sum[i]);
    }
  }
  long long sub = 1;
  long long itr = 0;
  cout << itr << endl;
  long long dp[40];
  for (int i = 0; i < 40; i++) {
    dp[i] = 0;
  }
  vector<map<long long, long long> > box;
  box.resize(40);
  for (long long i = 0; i < ans.size(); i++) {
    if (ans[i] == 0) {
    }
    itr = 0;
    while (ans[i] != 0) {
      if ((ans[i] & 1) == 1) {
        box[itr][i] = 1;
      }
      ans[i] >>= 1;
      itr++;
    }
  }
  cout << 1 << endl;
}
