***** CONTEST SCOREBOARD *****
Contest time: 05:00:00

            1:class     3:exp    4:lamp  5:meteor     6:pix   7:super    8:taxi    9:town     Total
---------------------------------------------------------------------------------------------------
 jsteinha   02:55+0  03:12+40  01:01+20  00:48+20  04:23+20  01:20+20  01:49+20  03:44+20   8/21:55
avgustina  02:41+20  02:40+20 04:22+100 01:02+160  04:13+20            02:58+80             6/24:39
 akolosov                      01:08+40 01:56+100                                           2/05:24
    vatsa                       02:23+0                                                     1/02:23
      MGM                                                             04:21+100             1/06:01

 jsteinha: -
avgustina: -
 akolosov: -
    vatsa: -
      MGM: -

***** CLARIFICATIONS *****
Memory limit is back to 128MB.  Ignore problem 2 (it was included by mistake).
(problem 1): If there are more than 2 students, the oldest and youngest
*do* get along.

(problem 4): This problem has a multi-input format.  The first line
contains an integer saying the number of test cases which follow (between 1
and 10 test cases).  Each test case then follows the format described in
the problem's description.  Test cases are separated by a blank line.

For the output, you should output the answer for each test case, one per
line.  Here is a correct example input/output:
Input:
2

6 -10 20
-8 4 2
25 4 7
3 10 1
0 15 4
17 3 5
16 4 2

3 4 20
8 5 10
8 4 7
19 4 10

Output:
5
-1

(problem 8): For each of the n lines, the times and profits are given in
increasing order of cab line number.  Times and profits are always at least
.0001, and they are never more than 100.

(problem 9): No town can be at a negative position.