#include<algorithm>
#include<iostream>
#include<random>
#include<set>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

const int THRESH=15;

vi solve(int n,int m,vi a){
  vi ans;
  set<int> occ;
  int x=0;
  vi idx;
  rep(i,m){
    x^=a[i];
    idx.push_back(i);
    occ.insert(i);
  }
  int time=THRESH;
  int pos=0;
  while(time>0&&x<0xfffff){
    //cerr<<"time="<<time<<" x="<<x<<endl;
    pii ma(-1,-1);
    rep(i,n){
      if(occ.count(i)==0){
	int diff=a[i]^a[idx[pos]];
	ma=max(ma,pii(diff^x,i));
      }
    }
    if(ma.second<0){
      break;
    }
    int ind=ma.second;
    occ.erase(idx[pos]);
    occ.insert(ind);
    x^=a[ind]^a[idx[pos]];
    idx[pos]=ind;
    pos=(pos+1)%m;
    time--;
  }
  rep(i,m)ans.push_back(a[idx[i]]);
  return ans;
}

#if 0
int main(void) {
  int n=100000;
  int seed;
  cin>>seed;
  mt19937 mt(seed);
  vi a(n);
  set<int> occ;
  rep(i,n){
    int v;
    do{
      v=mt()%1000000+1;
    }while(occ.count(v));
    a[i]=v;
    occ.insert(v);
  }
  int m=mt()%n+1;
  vi ans=solve(n,m,a);
  int sc=0;
  rep(i,m)sc^=ans[i];
  cout<<"score="<<sc<<" (hex:"<<hex<<sc<<")"<<endl;
}
#else
int main(){
  int n,m;
  cin>>n>>m;
  vi a(n);
  rep(i,n)cin>>a[i];
  vi ans=solve(n,m,a);
  rep(i,m){
    cout<<ans[i]<<(i==m-1?"\n":" ");
  }
}
#endif