import java.util.Arrays;
import java.util.Scanner;

public class BOJ_1759 {


    static String[] alpha;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] nm = sc.nextLine().split("\\s");
        int n = Integer.parseInt(nm[0]);
        int m = Integer.parseInt(nm[1]);

        alpha = sc.nextLine().split("\\s");
        Arrays.sort(alpha);

        solve(n, alpha, "", 0);


    }

    private static void solve(int n, String[] alpha, String password, int i) {
        if (n == password.length()) {
            if (check(password)) {
                System.out.println(password);
                return;
            }
        }

        if (i >= alpha.length)
            return;

        solve(n, alpha, password + alpha[i], i + 1);
        solve(n, alpha, password, i + 1);
    }

    private static boolean check(String password) {
        char[] chars = password.toCharArray();

        int mo = 0;
        int ja = 0;
        for (char alpha : chars) {
            if (alpha == 'a' || alpha == 'e' || alpha == 'i' || alpha == 'o' || alpha == 'u') {
                mo++;
            } else {
                ja++;
            }
        }
        return mo >= 1 && ja >= 2;
    }


}

import java.util.Scanner;

public class BOJ_14501 {

    static int[] time;
    static int[] price;
    static int answer = 0;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        time = new int[n];
        price = new int[n];

        for (int i = 0; i < n; i++) {
            time[i] = sc.nextInt();
            price[i] = sc.nextInt();
        }

        solve(n, 0, 0, 0);
        System.out.println(answer);

    }

    private static void solve(int n, int t, int p, int i) {

        if (t == n) {
            if (p > answer)
                answer = p;
            return;
        }

        if (t > n)
            return;

        solve(n, t + time[i], p + price[i], i + time[i]);
        solve(n, t + 1, p, i + 1);

    }
}

import java.util.*;

public class BOJ_10819 {

    static int[] arr;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        Arrays.sort(arr);


        int max = 0;
        while (nextPermutation()) {
            int answer = 0;
            for (int i = 0; i < n - 1; i++) {
                answer += Math.abs(arr[i] - arr[i + 1]);
            }
            max = Math.max(answer, max);
        }
        System.out.println(max);

    }

    private static boolean nextPermutation() {

        int idx = arr.length - 1;

        while (true) {

            if (idx == 0) {
                return false;
            }

            if (arr[idx - 1] >= arr[idx]) {
                idx -= 1;
                continue;
            }

            int i = idx;
            int j = -1;
            for (int k = idx - 1; k < arr.length; k++) {
                if (arr[idx - 1] < arr[k])
                    j = k;
            }

            if (j != -1) {
                swap(i - 1, j);
                reverse(i);
                break;
            }
        }
        return true;
    }

    private static void reverse(int lh) {
        int temp = 0;
        int rh = arr.length - 1;
        while (lh < rh) {
            temp = arr[lh];
            arr[lh] = arr[rh];
            arr[rh] = temp;
            lh += 1;
            rh -= 1;
        }
    }

    private static void swap(int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }

}

import java.util.Scanner;
import java.util.Stack;

public class BOJ_10974 {

    static int[] arr;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = i + 1;
        }

        print();
        while (true) {
            if (nextPermutation())
                continue;
            else break;
        }
    }

    private static boolean nextPermutation() {

        int idx = arr.length - 1;

        while (true) {

            if (idx == 0) {
                return false;
            }

            if (arr[idx - 1] > arr[idx]) {
                idx -= 1;
                continue;
            }

            int i = idx;
            int j = -1;
            for (int k = idx - 1; k < arr.length; k++) {
                if (arr[idx - 1] < arr[k])
                    j = k;
            }

            if (j != -1) {
                swap(i - 1, j);
                reverse(i);
                print();
                break;
            }
        }

        return true;
    }

    private static void print() {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < arr.length; i++) {
            sb.append(arr[i]);
            if (i != arr.length - 1)
                sb.append(" ");
        }
        System.out.println(sb.toString());
    }

    private static void reverse(int idx) {
        Stack<Integer> stack = new Stack<>();
        for (int i = idx; i < arr.length; i++) {
            stack.add(arr[i]);
        }
        for (int i = idx; i < arr.length; i++) {
            arr[i] = stack.pop();
        }
    }

    private static void swap(int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}