Fişierul intrare/ieşire:	chess.in, chess.out	Sursă	IIOT 2021-22 Runda 1
Autor	Ioan Popescu, Stefan Dascalescu	Adăugată de	Stefan Dascalescu •stefdascalescu
Timp execuţie pe test	0.25 sec	Limită de memorie	32768 kbytes
Scorul tău	N/A	Dificultate	N/A

Vezi solutiile trimise | Statistici

Chess Tournament

Chess is becoming more and more popular in IIOTLand and as a result, the government decided to organize a chess tournament in order to award the best chess players from the country. In order to find out more about the outcome of the tournament, you have been asked by the government to analyze the results of each game played.

In short, you are given the descriptions of each game, move by move, and you have to print the outcome of each game. The moves are noted according to the algebraic chess notation.

The description of each game contains the moves, which are given in the input as a string (the string contains spaces) and the moves are described one by one, the first part of the move representing the first player's move while the second part of the move represents the second player's move, unless the game is finished by the first player, in this case the second part doesn't exist.

It is known that all the games have been played until the very end (thus, there were no resigns) and that the game can be either won by one of the players, or result in a draw.

Date de intrare

The first line of the input file chess.in contains t, the number of games played in the tournament

The next t lines contain the strings representing the description of each game

Date de ieşire

The output file chess.out will contain for each of the testcases a string, which is either "First", if the first player wins, "Second", if the second player wins, or "Draw", if the outcome is a draw.

Restricţii

• 1 ≤ t ≤ 5000
• 1 ≤ |s| ≤ 5000

Exemplu

Cum se trimit solutii?