export {};

function dfs(n:number, m:number, nums:number[], result:number[], current:number) {
    if(result.length === m) {
        console.log(...result);
        return;
    }

    let prev = -1;
    for(let i=current; i<N; i++){
        if(nums[i] !== prev) {
            prev = nums[i];
            result.push(nums[i]);
            dfs(n,m,nums,result,i);
            result.pop();
        }
    }
}

const input: string[] = require("fs").readFileSync(0,'utf8').toString().trim().split('\n');
const [N, M]: number[] = input[0].split(' ').map(Number);
let nums: number[] = input[1].split(' ').map(Number);
nums.sort((a,b)=> a-b);

dfs(N,M,nums,[],0);