#include using ll = long long; #define show(x) std::cerr << #x << " = " << (x) << std::endl template std::ostream& operator<<(std::ostream& os, const std::vector& v) { os << "["; for (const auto& p : v) { os << p << ","; } return (os << "]\n"); } int main() { int N, K; std::cin >> N >> K; std::vector a(N); for (int i = 0; i < N; i++) { std::cin >> a[i]; } auto comp = [](const std::string& s1, const std::string& s2) { return s1 + s2 == s2 + s1 ? s1.size() > s2.size() : s1 + s2 > s2 + s1; }; std::sort(a.begin(), a.end(), comp); std::vector ind(N); std::iota(ind.begin(), ind.end(), 0); auto next = [&]() -> bool { std::string now; for (int i = 0; i < N; i++) { now += a[ind[i]]; } std::string max; std::vector maxind; for (int i = N - 2; i >= 0; i--) { if (ind[i] >= ind[i + 1]) { continue; } for (int j = N - 1; j > i; j--) { if (ind[j] <= ind[i]) { continue; } auto index = ind; std::swap(index[i], index[j]); std::reverse(index.begin() + i + 1, index.end()); for (int j = i + 1; j < N; j++) { auto inde = index; std::swap(inde[i + 1], inde[j]); std::string s; for (int i = 0; i < N; i++) { s += a[inde[i]]; } if (s < now and max < s) { max = s, maxind = inde; } } // break; } break; } return ind = maxind, true; }; for (int i = 0; i < K; i++) { for (int i = 0; i < N; i++) { std::cout << a[ind[i]]; } std::cout << std::endl; if (not next()) { break; } } return 0; }