using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;

class Program
{
    static void Main()
    {
        var dt = DateTime.Now;
        var nm = ReadLine().Split().Select(int.Parse).ToArray();
        var N = nm[0];
        var M = nm[1];
        var a = ReadLine().Split().Select(int.Parse).ToList();
        a.Sort();
        var A = a.ToArray();

        var xor = 0;
        var ans = new int[M];
        OrgSet = A.ToArray();
        CombSet = A.Where((x, i) => i < M).ToArray();
        var_Combin = CP = M -1;
        Max = A.Where((x, i) => i >= N - M).ToArray();
        Finished = false;
        while (!Finished&& (DateTime.Now - dt).TotalMilliseconds < 1000)
        {
            for (int i = 0; !Finished && i < 100; i++)
            {
                var o = 0;
                for (int j = 0; j < M; j++)
                {
                    o ^= CombSet[j];
                }
                if (xor < o)
                {
                    xor = o;
                    for (int k = 0; k < M; k++)
                    {
                        ans[k] = CombSet[k];
                    }
                }
                NextCombination();
            }
        }
        for (int i = 0; i < M - 1; i++)
        {
            Write($"{ans[i]} ");
        }
        WriteLine(ans[M - 1]);
    }
    static int[] OrgSet;
    static int[] CombSet;
    static int CP;
    static int var_Combin;
    static int[] Max;
    static bool Finished;

    static void NextCombination()
    {
        if (Finished) return;

        if (CombSet[0] >= Max[0])
        {
            Finished = true;
            return;
        }

        if (CombSet[CP] == Max[CP])
        {
            while (CombSet[CP] == Max[CP]) CP--;
            int Loc = CombSet[CP];
            if (CombSet[CP] + 1 == Max[CP]) CombSet[CP] = ++Loc;
            else for (int t = CP; t <= var_Combin; t++) CombSet[t] = ++Loc;
            CP = var_Combin;
            return;
        }
        else CombSet[CP]++;
    }
}