#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N;
int M;
vector<int> numbers;
int flag[8];
int answer[8];
void makeCombination(int cnt) {
if (cnt == M) {
for (int i = 0; i < M; i++) {
cout << answer[i] << ' ';
}
cout << '\n';
return;
}
int same = 0; // 함수 안에 두어야 같은 위상과 공유 된다.
for (int i = 0; i < numbers.size(); i++) {
if (flag[i] == 1 || numbers[i] == same) {
continue;
}
flag[i] = 1;
answer[cnt] = numbers[i];
same = answer[cnt];
// cout << same << '\n';
makeCombination(cnt + 1);
flag[i] = 0;
}
}
int main() {
cin >> N >> M;
numbers.resize(N);
for (int i = 0; i < N; i++) {
cin >> numbers[i];
}
sort(numbers.begin(), numbers.end());
makeCombination(0);
return 0;
}