1759_1.cpp

// Authored by : BaaaaaaaaaaarkingDog
// Co-authored by : -
// http://boj.kr/700bd7f11e834635a055fdf0845f4409
#include <bits/stdc++.h>
using namespace std;

int l, c;
char s[20];

bool aeiou(char t){
  return t == 'a' || t == 'e' || t == 'i' || t == 'o' || t == 'u';
}

int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> l >> c;
  for(int i = 0; i < c; i++) cin >> s[i];
  sort(s, s+c);
  vector<int> brute(c);
  for(int i = l; i < c; i++) brute[i] = 1;
  do{
    string ans;
    int cnt1 = 0; // 모음의 수
    for(int i = 0; i < c; i++){
      if(brute[i] == 0){
        ans += s[i];
        if(aeiou(s[i])) cnt1++;
      }      
    }
    if(cnt1 < 1 || l - cnt1 < 2) continue;
    cout << ans << '\n';
  }while(next_permutation(brute.begin(), brute.end()));
}