using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int[] dx = new int[] { 0, 0, 1, -1 };
    static int[] dy = new int[] { 1, -1, 0, 0 };

    static void Solve()
    {
        var n = sc.Int();
        var m = sc.Int();

        var a = sc.Int(n);
        var used = new bool[n];
        var xor = 0;

        for (int i = 0; i < m; i++) {
            xor ^= a[i];
            used[i] = true;
        }

        for (int i = 0; i < 100000; i++) {
            var rnd = new Random();
            var rnd1 = rnd.Next() % n;
            var rnd2 = rnd.Next() % n;

            if (rnd1 == rnd2)
                continue;
            
            if ((used[rnd1] && used[rnd2]) || (!used[rnd2] && !used[rnd1]))
                continue;
            
            if (used[rnd2])
            {
                var tmp = rnd1;
                rnd1 = rnd2;
                rnd2 = tmp;
            }

            var prev = xor;

            xor ^= a[rnd1];
            xor ^= a[rnd2];

            if (prev < xor)
            {
                used[rnd1] = false;
                used[rnd2] = true;
            }
            else
            {
                xor ^= a[rnd1];
                xor ^= a[rnd2];
            }
        }

        var cnt = 0;

        for (int i = 0; i < n; i++) {
            if (used[i]) {
                if (cnt != 0)
                    pr.Write(' ');
                pr.Write(a[i]);
                cnt++;
            }
        }

        pr.WriteLine();
    }

    static int[,] Mul(int[,] a, int[,] b)
    {
        var ret = new int[a.GetLength(0), b.GetLength(1)];
        for (int i = 0; i < a.GetLength(0); i++)
            for (int j = 0; j < b.GetLength(1); j++)
                for (int k = 0; k < a.GetLength(1); k++)
                    ret[i, j] += a[i, k] * b[k, j];

        return ret;
    }

    static int[,] Pow(int[,] a, int n)
    {
        var b = new int[a.GetLength(1), a.GetLength(0)];

        var f = n % 2 == 1;

        for (int i = 0; i < a.GetLength(0); i++)
            b[i, i] = 1;

        while (n > 0)
        {
            if (n % 2 == 1)
                b = Mul(a, b);


            n >>= 1;
        }

        return b;
    }

    class Coord
    {
        public int x;
        public int y;
    }

    static void Main(string[] args)
    {
        // pr.AutoFlush = true;
        Solve();
        pr.Flush();
        // Console.ReadKey();
    }

    static Scanner sc = new Scanner();
    static Printer pr = new Printer();
}

#region IO
class Scanner
{
    private int _i = 0;
    private string[] line = new string[0];

    private T[] Enumerate<T>(int n, Func<T> f)
    {
        T[] ret = new T[n];
        for (int i = 0; i < n; i++)
            ret[i] = f();
        return ret;
    }

    public string Str()
    {
        if (line.Length <= _i)
        {
            line = Console.ReadLine().Split(' ');
            _i = 0;
        }

        return line[_i++];
    }

    public int Int() => int.Parse(Str());
    public long Long() => long.Parse(Str());
    public double Double() => double.Parse(Str());
    public int[] Int(int n) => Enumerate(n, Int);
    public long[] Long(int n) => Enumerate(n, Long);
    public double[] Double(int n) => Enumerate(n, Double);
    public string[] Str(int n) => Enumerate(n, Str);
}

class Printer : StreamWriter
{
    public Printer() : base(Console.OpenStandardOutput())
    {
        AutoFlush = false;
    }
}
#endregion