MatchMaker
----------
In Computer Science, pattern matching is the act of checking if a 
certain sequence conforms (matches) a given pattern. Patterns are 
usually specified using a language based on regular expression. In 
this problem, we'll use a simple regular expression to express 
patterns on sequences of decimal digits. A pattern is a sequence of 
one or more decimal digits 0, ..., 9, and the letters e and o. The
letter e denotes a sequence of an even number of digits, whereas the
letter o denotes a sequence of an odd number of digits. For example, 
the pattern "129" only matches the sequence 129. The pattern "1e3" 
matches all sequences beginning with 1, ending with 3, and having an
even number of decimal digits between the first and last digits. As 
another example, the pattern "o55" matches the sequences 155, 12355, 
1234555, but none of the sequences 55, 1255, 123455.  Your task is to 
write a program to find if a given sequence matches a given pattern.

Input
-----
Your program will be tested on one or more data sets. The first line 
contains an integer N (N < 100), which is the number of data sets.  
Each data set contains a single pattern and one or more sequences to 
match. The first line of each data set specifies the pattern, and the 
remaining lines specify the sequences to match against that pattern. 
The end of a data set is identified by the word "END" (without the 
double quotes.) All lines are 100,000 characters long or shorter.

Output
------
For each sequence, print true if it matches the pattern and false
otherwise.

Sample Input
------------
3
129
1299
129
1129
END
1e3
123
1223
END
o55
155
12355
55
1255
END

Sample Output
-------------
false
true
false
false
true
true
true
false
false