/*
MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋
http://www.cnblog.com/MiYu
Author By : MiYu
Test : 4
Program : 1075
*/
#include <iostream>
#include <string>
using namespace std;
typedef struct dict DIC;
DIC *root = NULL;
string ext = "";
struct dict {
dict (){ str = "";memset ( child , 0 , sizeof ( child ) ); }
~dict () { }
void del ( DIC * node );
string & insert ( char *ins,char *key = NULL );
string & find ( char *ins );
string & operator [] ( char *a );
string & operator = ( char *a );
DIC *child[26];
string str;
};
void dict::del ( DIC * node )
{
if ( node == NULL ) return;
for ( int i = 0; i != 26; ++ i )
{
if ( node->child[i] != NULL ) del ( node->child[i] );
}
node->str = "";
free ( node );
}
string & dict::operator [] ( char *a )
{
string &str = find ( a );
if ( str == "" )
return insert ( a );
return str;
}
string & dict::operator = ( char *a )
{
return this->str = a;
}
string & dict::insert ( char *ins,char *key )
{
DIC *cur = this,*now;
int len = strlen ( ins );
for ( int i = 0; i != len; ++ i )
{
if ( cur->child[ ins[i] - 'a' ] != NULL )
{
cur = cur->child[ ins[i] - 'a' ];
}
else
{
now = new DIC;
cur->child[ ins[i] - 'a' ] = now;
cur = now;
}
}
return cur->str;
}
string & dict::find ( char *ins )
{
DIC *cur = this;
int len = strlen ( ins );
for ( int i = 0; i != len; ++ i )
{
if ( cur->child[ ins[i] - 'a' ] != NULL )
cur = cur->child[ ins[i] - 'a' ];
else
return ext;
}
return cur->str;
}
char words[3010],temp[12],t[12];
int main ()
{
DIC dict;
root = &dict;
scanf ( "%s", t );
while ( scanf ( "%s", t ), strcmp ( t, "END" ) != 0 )
{
scanf ( "%s", temp );
dict[temp] = t;
}
scanf ( "%s", t );
getchar();
while ( gets ( words ) && strcmp ( words, "END" ) != 0 )
{
memset ( temp, 0, sizeof ( temp ) );
int len = strlen ( words );
for ( int i = 0,j = 0; i != len; ++ i )
{
if ( isalpha ( words[i] ) )
{
temp[j++] = words[i];
}
else
{
temp[j] = '\0';
string str = dict[ temp ];
if ( str == "" )
printf ( "%s",temp );
else
printf ( "%s",str.c_str() );
putchar ( words[i] );
j = 0;
}
}
putchar ( 10 );
}
return 0;
}