#include #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) using namespace std; typedef pair P; const int mod = 1000000007; const int INF = 1e12; unsigned w; unsigned xor128() { static unsigned x = 123456789, y = 362436069, z = 521288629/*, w = 88675123*/; unsigned t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } class Timer { private: clock_t start; public: Timer() { start = clock(); } double sec() { clock_t end = clock(); return (double) (end - start) / CLOCKS_PER_SEC; } }; const double TimeLimit = 1.450; Timer timer; signed main(){ ios::sync_with_stdio(false); cin.tie(0); clock_t start, end; start = clock(); random_device rnd; mt19937 mt((int)time(0)); w = mt(); int n, m; cin >> n >> m; vector a(n); rep(i, 0, n){ cin >> a[i]; } sort(all(a)); // vector ans; set st; int now = 0; repb(i, n - 1, 0){ if(now ^ a[i] > now){ now ^= a[i]; // ans.push_back(i); st.insert(i); } if(st.size() == m) break; } rep(i, 0, n){ if(st.size() == m) break; if(!st.count(i)){ now ^= a[i]; // ans.push_back(i); st.insert(i); } } while(1){ double tmp = timer.sec(); if(tmp > TimeLimit){ break; } int id = xor128() % n; int id2 = xor128() % n; if(!(st.count(id) ^ st.count(id2))) continue; if(st.count(id2)) swap(id, id2); int tmp2 = now ^ a[id] ^ a[id2]; if(tmp2 > now){ now = tmp2; st.erase(id); st.insert(id2); } // if((int)(tmp * 1000) % 100 <= 20){ // cerr << tmp << " " << now << endl; // } } int sum = 0; for(auto it = st.begin(); it != st.end(); it++){ if(it != st.begin()) cout << ' '; cout << a[*it]; sum ^= a[*it]; } cout << endl; cerr << now << " " << sum << endl; }