문제1300--Securing the Barn

### 1300: Securing the Barn

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 27  통과: 10
[제출] [채점기록] [묻고답하기]

#### 문제 설명

Farmer John has installed a new security system on the barn and now must issue a valid password to the cows in the herd. A valid password consists of L (3 <= L <= 15) different lower-case characters (from the traditional latin character set 'a'...'z'), has at least one vowel ('a', 'e', 'i', 'o', or 'u'), at least two consonants (non-vowels), and has characters that appear in alphabetical order (i.e., 'abc' is valid; 'bac' is not).

Given a desired length L along with C lower-case characters, write a program to print all the valid passwords of length L that can be formed from those letters. The passwords must be printed in alphabetical order, one per line.

#### 입력 설명

* Line 1: Two space-separated integers, L and C

* Line 2: C space-separated lower-case characters that are the set of characters from which to build the passwords

#### 출력 설명

* Lines 1..?: Each output line contains a word of length L characters (and no spaces). The output lines must appear in alphabetical order.

#### 입력 예시 Copy

4 6
a t c i s w

#### 출력 예시 Copy

acis
acit
aciw
acst
acsw
actw
aist
aisw
aitw
astw
cist
cisw
citw
istw

#### 도움

INPUT DETAILS:
Passwords of length 4 chosen from the given six characters