uva 10815

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <ctype.h>//isalpha,isdight,toupper
#include <map>
#include <sstream>
typedef long long ll;
using namespace std;
#define inf 0x3f3f3f3f
const int maxn=25;

set<string>dict;

int main(){
    string s,buf;
    while(cin>>s){
        for(int i=0;i<s.length();i++){
            if(isalpha(s[i]))s[i]=tolower(s[i]);
            else s[i]=' ';
            stringstream ss(s);
            while(ss>>buf){
                dict.insert(buf);
            }
        }
        for(set<string>::iterator it = dict.begin();it!=dict.end();it++){
            cout<<*it<<endl;
        }
    }
    return 0;
}