#include #include using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; typedef unsigned long long ull; unsigned int xor128(){ static unsigned int x=123456789, y=362436069, z=521288629, w=88675123; unsigned int t; t=(x^(x<<11)); x=y; y=z; z=w; return w=(w^(w>>19))^(t^(t>>8)); } class Timer { double start_time; double getNow(){ struct timeval t; gettimeofday(&t, NULL); return t.tv_sec + t.tv_usec * 1e-6; } public: void start(){ start_time = getNow(); } double getSec(){ return getNow()-start_time; } }; vector solve(const vector& v, int N, int M){ Timer timer; timer.start(); bitset<100005> w; int score = 0; rep(i,M){ w[i] = 1; score ^= v[i]; } int t = 0; while(t<46){ /* for(int i=22; i>=0; i--){ if((score>>i)&1) cout << 1; else cout << 0; } cout << endl; */ int br = 22 - (t%23); int th = 1<<(br+1); vector p1, p0; vector q1, q0; rep(i,N){ if(v[i]>=th) continue; if(w[i]){ if((v[i]>>br)&1) p1.push_back(i); else p0.push_back(i); }else{ if((v[i]>>br)&1) q1.push_back(i); else q0.push_back(i); } if((p1.size()>1 && q0.size()>1) || (p0.size()>1 && q1.size()>1)) break; } if((score>>br)&1){ if(p1.size()>1 && q0.size()>1){ random_shuffle(ALLOF(p1)); random_shuffle(ALLOF(q0)); int t_score = score; t_score ^= v[p1[0]]; t_score ^= v[p1[1]]; t_score ^= v[q0[0]]; t_score ^= v[q0[1]]; if(score <= t_score){ w[p1[0]] = 0; w[p1[1]] = 0; w[q0[0]] = 1; w[q0[1]] = 1; score ^= v[p1[0]]; score ^= v[p1[1]]; score ^= v[q0[0]]; score ^= v[q0[1]]; } } /* else if(p0.size()>1 && q1.size()>1){ int t_score = score; t_score ^= v[p0[0]]; t_score ^= v[p0[1]]; t_score ^= v[q1[0]]; t_score ^= v[q1[1]]; if(score <= t_score){ w[p0[0]] = 0; w[p0[1]] = 0; w[q1[0]] = 1; w[q1[1]] = 1; score ^= v[p0[0]]; score ^= v[p0[1]]; score ^= v[q1[0]]; score ^= v[q1[1]]; } } */ }else{ if(p1.size()>0 && q0.size()>0){ w[p1[0]] = 0; w[q0[0]] = 1; score ^= v[p1[0]]; score ^= v[q0[0]]; } else if(p0.size()>0 && q1.size()>0){ w[p0[0]] = 0; w[q1[0]] = 1; score ^= v[p0[0]]; score ^= v[q1[0]]; } } t++; } #ifdef LOCAL cerr << score << endl; for(int i=22; i>=0; i--){ if((score>>i)&1) cerr << 1; else cerr << 0; } cerr << endl; #endif vector ret; rep(i,w.size()){ if(w[i]) ret.push_back(v[i]); } return ret; } int main(){ int N, M; cin >> N >> M; vector v; rep(i,N){ #ifdef LOCAL v.push_back(1+i); #else int a; cin >> a; v.push_back(a); #endif } int score = 0; vector ret; Timer atimer; atimer.start(); while(atimer.getSec()<1.3){ random_shuffle(ALLOF(v)); vector res = solve(v, N, M); int t_score = 0; rep(i,M){ t_score ^= res[i]; } if(score < t_score){ score = t_score; ret = res; } } #ifdef LOCAL cerr << score << endl; for(int i=22; i>=0; i--){ if((score>>i)&1) cerr << 1; else cerr << 0; } cerr << endl; #endif #ifndef LOCAL rep(i,ret.size()){ if(i>0) cout << " "; cout << ret[i]; } cout << endl; #endif return 0; }