#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

#pragma region
#include<time.h>
namespace TIME{
clock_t start,end;
void time_start(){
	start = clock();
}
void time_set(int t){
	end = start + t;
}
bool check(){
	return clock() < end;
}
/*
unsigned long long get_cycle(){
	return __rdtsc();
}
unsigned long long start,limit;
void time_start(){
	start = get_cycle();
}
//あたいをーさぐらないとーだめー
void time_set(unsigned long long num){limit = num;}
bool check(){return (get_cycle() < start+limit);}
*/
}
#pragma endregion //時間計測

#pragma region

namespace RAND{
unsigned long xor128(){ 
	static unsigned long x=123456789,y=362436069,z=521288629,w=88675123; 
	unsigned long t; 
	t=(x^(x<<11));x=y;y=z;z=w;
	return( w=(w^(w>>19))^(t^(t>>8)) ); 
}
LL getRAND(LL P){
	return ((xor128()%P)+P)%P;
}
}

#pragma endregion //乱数

///////////////////
int N,M;
int best;
int nowVal;//現在の値
vector<int> A;
vector<int> use;//使用中
vector<int> Notuse;//未使用
vector<int> bestUse;
void cal(){//一回だけ
	int ret = 0;
	for(int i=0;i<M;++i){
		ret ^= A[ use[i] ];
	}
	best = max(best,ret);
	bestUse = use;
	nowVal = ret;
}
void output(){
	bool flag = false;
	for(int i=0;i<M;++i){
		if(flag){
			cout << ' ';
		}
		cout << A[ use[i] ];
		flag = true;
	}
	cout << endl;
}
void solve(){
	TIME::time_start();
	TIME::time_set(1000000);
	cin>>N>>M;
	A = vector<int>(N);
	for(int i=0;i<N;++i){
		cin>>A[i];
	}
	
	sort(A.begin(),A.end());
	//reverse(A.begin(),A.end());
	use = vector<int>(M);
	Notuse = vector<int>(N-M);
	for(int i=0;i<N;++i){
		if(i<M){
			use[i] = i;
		}else{
			Notuse[i-M] = i;
		}
	}
	if( N==M ){
		output();
		return;
	}

	int count = 800000;
	int loop = 0;
	while(TIME::check()){
		++loop;
		count = max(0,count-1);
		//cout << count << " " << best << "\r";
		//未使用を一つ選ぶ
		int ter0 = RAND::getRAND(N-M);

		//使用中を一つ選ぶ
		int ter1 = RAND::getRAND(M);

		//交換
		int val = A[ Notuse[ter0] ]^A[ use[ter1] ];
		nowVal ^= val;
		
		if( best - nowVal < (count) ){
			swap( Notuse[ter0],use[ter1] );
			if( best -nowVal < 0 ){
				best = nowVal;
				bestUse = use;
			}
		}else{//
			nowVal ^= val;
		}
	}
	output();
	cerr << loop << endl;
	cerr << count << ":";
	cerr << TIME::start << " " << TIME::end << " ";
	cerr << clock() <<  endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()