{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eThere is a chessboard of the size \u003cstrong\u003eM\u003c/strong\u003e×\u003cstrong\u003eN\u003c/strong\u003e. \u003cstrong\u003eK\u003c/strong\u003e fairy chess pieces called (\u003cstrong\u003ep\u003c/strong\u003e, \u003cstrong\u003eq\u003c/strong\u003e)-leapers (\u003cstrong\u003ep\u003c/strong\u003e \u003c \u003cstrong\u003eq\u003c/strong\u003e) are placed in some squares on this board. Leaper’s move is similar to a regular chess knight’s move, with some constraints though. When (\u003cstrong\u003ep\u003c/strong\u003e, \u003cstrong\u003eq\u003c/strong\u003e)-leaper moves, it can move \u003cstrong\u003ep\u003c/strong\u003e squares horizontally and \u003cstrong\u003eq\u003c/strong\u003e squares vertically (only upward), or \u003cstrong\u003eq\u003c/strong\u003e squares horizontally (only leftward) and \u003cstrong\u003ep\u003c/strong\u003e squares vertically. In other words, the move to \u003cstrong\u003eq\u003c/strong\u003e squares must be in a direction where corresponding coordinate decreases. Moving outside of the board is prohibited. However several leapers are allowed to occupy the same square.\u003c/p\u003e\n\n\u003cp\u003eTwo players are playing the game, alternating moves. In his turn a player chooses some leaper and moves it according to the rules. The player who is not able to move any leaper loses the game. Givena board configuration determine the winner, assuming both players play optimally.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eInput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eThe first line of input contains \u003cstrong\u003e5\u003c/strong\u003e integers: \u003cstrong\u003eM\u003c/strong\u003e, \u003cstrong\u003eN\u003c/strong\u003e, \u003cstrong\u003eK\u003c/strong\u003e, \u003cstrong\u003ep\u003c/strong\u003e, \u003cstrong\u003eq\u003c/strong\u003e (\u003cstrong\u003e1\u003c/strong\u003e ≤ \u003cstrong\u003eM\u003c/strong\u003e, \u003cstrong\u003eN\u003c/strong\u003e ≤ \u003cstrong\u003e10^9\u003c/strong\u003e^\\{ \\}, \u003cstrong\u003e1\u003c/strong\u003e ≤ \u003cstrong\u003eK\u003c/strong\u003e ≤ \u003cstrong\u003e10^5\u003c/strong\u003e^\\{ \\}, \u003cstrong\u003e1\u003c/strong\u003e ≤ \u003cstrong\u003ep\u003c/strong\u003e \u003c \u003cstrong\u003eq\u003c/strong\u003e ≤ \u003cstrong\u003e20\u003c/strong\u003e). Each of following \u003cstrong\u003eK\u003c/strong\u003e lines contains coordinates \u003cstrong\u003er_i\u003c/strong\u003e and \u003cstrong\u003ec_i\u003c/strong\u003e of corresponding leaper (\u003cstrong\u003e1\u003c/strong\u003e ≤ \u003cstrong\u003er_i\u003c/strong\u003e ≤ \u003cstrong\u003eM\u003c/strong\u003e, \u003cstrong\u003e1\u003c/strong\u003e ≤ \u003cstrong\u003ec_i\u003c/strong\u003e ≤ \u003cstrong\u003eN\u003c/strong\u003e).\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eOutput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eThe single line of output should contain string \u003cstrong\u003eFirst\u003c/strong\u003e, if the first player wins the game under optimal strategy, and \u003cstrong\u003eSecond\u003c/strong\u003e otherwise.\u003c/p\u003e\n\n"}},{"title":"Example","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e10 10 2 1 2\n3 7\n7 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eSecond\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}