Problem Description

A common problem faced by electronic information providers is determining the number of unique words in a document. The case of a word does not affect its uniqueness. For example, The, tHE and The are all considered equivalent. Punctuation can appear in these documents and is handled as follows:
1) Periods '.' and exclamation marks '!' may appear at the end of a sentence and should not be considered a word, or part of a word.
2) Dashes '-' appear between hyphenated words. The hyphenated words should be considered separately.
3) Commas ',' colons ':' and semicolons ';' appear within a sentence and should not be considered a word, or part of a word.
4) Apostrophes ' appear within contractions and possessive forms. These symbols should be treated as if they never appeared (i.e., as if they were deleted from the word).

Input

The input file contains a series of documents, each separated by an entire line of text containing only the word EOD Each document will contain no more than 1,000 lines and at most 100 unique words. All input lines will not contain more than 80 characters. Numbers, control characters, and punctuation symbols not listed above will not appear in the text. An entire line containing only the string EOT identifies the end of the list of documents; note this last document is terminated by EOT and not EOD

Output

The output should be an alphabetically sorted list of all unique words, with each unique word displayed in uppercase.

The banker hammered home his two-part message! His message, 
at times satirical, was that the bank's situation was a mess.
EOD
Hello world
EOD
This is a
final example
EOT

WORDS IN DOCUMENT #1
A
AT
BANKER
BANKS
HAMMERED
HIS
HOME
MESS
MESSAGE
PART
SATIRICAL
SITATUATION
THAT
THE
TIMES
TWO
WAS
WORDS IN DOCUMENT #2
HELLO
WORLD
WORDS IN DOCUMENT #3
A
EXAMPLE
FINAL
IS
THIS

Author

2008 ACM ICPC Regional hangzhou