Who Solves the Problem the Fastest?
-----------------------------------
Two professors try to solve a number of programming problems.
The one, let us call him F, simply tries to apply a number
of patterns.  He starts with the simplest pattern.  If that
pattern does not fit the problem, he tries to implement the 
one-but-simplest pattern, etc.  The other, let us call him E, 
uses a completely different approach.  He first thinks about 
the problem.  After some thinking, he picks a correct pattern
and implements it.  You are asked to determine for a number
of programming problem who will solve it the fastest, F or E?

To simplify matters, assume that it takes F one time units to
try to implement the first pattern, two time units for the
second pattern, etc.  Furthermore, assume that E thinks for
T time units and implements a correct pattern in I time units.

You are given two lines of input.  The first line contains 
the values of T and I, both are positive integers, separated 
by a space.  The second line one or more positive integers, 
separated by a space.  These positive integers capture the 
difficulty of the problems.  The difficulty of each problem 
is characterized by the number of attempts F needs to solve it.

For each problem, you have to print, on a separate line,
who will solve it the fastest, or declare a tie if both
the same number of time units.

Sample input
------------
12 9
104 4 32 1 6 8

Sample output
-------------
E
F
E
F
tie
E