#include <iostream>
#include <list>
#include <vector>
#include <string>
#include <stdio.h>
#include <stdint.h>
#include <iomanip>
using namespace std;

using ll = long long;

#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define FOR_LL( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR_LL( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;

template <typename T> inline T Distance( const T& a , const T& b ){ return a < b ? b - a : a - b; }

int main()
{

  CIN( ll , N );
  CIN( ll , M );
  ll A[100000], max = 0 , i = 0 , j = 0 , a;
  while( i < M ){
    cin >> a;
    A[i] = a;
    max = max ^ a;
    ++i;
  }
  const ll L = MIN( 1000000000 / M , N - M );
  while( j < L ){
    cin >> a;
    i = 0;
    ll i_max = -1;
    ll max_current = max;
    while( i < M ){
      ll m = max ^ a ^ A[i];
      if( max_current < m ){
	max_current = m;
	i_max = i;
      }
      ++i;
    }
    if( i_max != -1 ){
      max = max_current;
      A[i_max] = a;
    }
    ++j;
  }
  cout << A[0];
  i = 1;
  while( i < M ){
    cout << " " << A[i];
    ++i;
  }
  RETURN( "" );

}