B'In some country live wizards. They love playing with numbers. The blackboard has two numbers written on it -- a and b. The order of the numbers is not important. Let 's consider a xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89b for the sake of definiteness. The players can cast one of the two spells in turns: If a xe2 x80 x89> xe2 x80 x89b, similar moves are possible. If at least one of the numbers equals zero, a player can 't make a move, because taking a remainder modulo zero is considered somewhat uncivilized, and it is far too boring to subtract a zero. The player who cannot make a move, loses. To perform well in the magic totalizator, you need to learn to quickly determine which player wins, if both wizards play optimally: the one that moves first or the one that moves second. The first line contains a single integer t -- the number of input data sets (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89t xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89104). Each of the next t lines contains two integers a, b (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a, xe2 x80 x89b xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891018). The numbers are separated by a space. Please do not use the %lld specificator to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specificator. For any of the t input sets print "First" (without the quotes) if the player who moves first wins. Print "Second" (without the quotes) if the player who moves second wins. Print the answers to different data sets on different lines in the order in which they are given in the input. In the first sample, the first player should go to (11,10). Then, after a single move of the second player to (1,10), he will take 10 modulo 1 and win. In the second sample the first player has two moves to (1,10) and (21,10). After both moves the second player can win. In the third sample, the first player has no moves. In the fourth sample, the first player wins in one move, taking 30 modulo 10.'...