You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.

Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <math.h>
 4 #include <algorithm>
 5 #include <iostream>
 6 #include <ctype.h>
 7 #include <iomanip>
 8 #include <queue>
 9 #include <stdlib.h>
10 #include <sstream>
11 #include <map>
12 using namespace std;
13
14 int main()
15 {
16     char word[15], fword[15], str[25];
17     map<string, string> danci;
18
19     while (gets(str) && str[0] != '\0')
20     {
21         sscanf(str, "%s%s", word, fword);
22         danci[fword] = word;
23     }
24
25     while (cin >> fword)
26     {
27         if (danci.find(fword) != danci.end( ))
28             cout << danci[fword] << endl;
29         else
30             cout << "eh" << endl;
31     }
32
33     return 0;
34 }