Problem: This is an interactive problem.

Anton and Harris are playing a game to decide which of them is the king of problemsetting.

There are three piles of stones, initially containing a, b, and c stones, where a, b, and c are distinct positive integers. On each turn of the game, the following sequence of events takes place:

  * The first player chooses a positive integer y and provides it to the second player. 
  * The second player adds y stones to one of the piles, with the condition that he cannot choose the same pile in two consecutive turns. 



The second player loses if, at any point, two of the piles contain the same number of stones. The first player loses if 1000 turns have passed without the second player losing.

Feeling confident in his skills, Anton decided to let Harris choose whether he wants to go first or second. Help Harris defeat Anton and become the king of problemsetting!

Input

The first line of input contains three distinct positive integers a, b, and c (1 ≤ a, b, c ≤ 10^9) — the initial number of stones in piles 1, 2, and 3 respectively.

Interaction

The interaction begins by reading the integers a, b and c.

After reading the integers, print a single line containing either "First" or "Second", denoting who you want to play as (as first or second correspondently).

On each turn, the first player (either you or the judge) must print a positive integer y (1 ≤ y ≤ 10^{12}).

Then, the second player must print 1, 2, or 3, indicating which pile should have y stones added to it. From the second turn onwards, the pile that the second player chooses must be different from the pile that they chose on the previous turn.

If you are playing as Second and complete 1000 turns without losing, or if you are playing as First and the judge has determined that it cannot make a move without losing, the interactor will print 0 and will finish interaction. This means that your program is correct for this test case, and you should exit immediately.

If you are playing as First and complete 1000 turns without winning, or if you are playing as Second and print a move that makes two piles have the same number of stones, or if you output an invalid move as either player, the interactor will print -1 and will finish interaction. You will receive a Wrong Answer verdict. Make sure to exit immediately to avoid getting other verdicts.

After printing something do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++; 
  * System.out.flush() in Java; 
  * flush(output) in Pascal; 
  * stdout.flush() in Python; 
  * see documentation for other languages. 



In this problem, hacks are disabled.

Example

Input


5 2 6


3

0

Output



First
2

3

Note

In the sample input, the piles initially have 5, 2, and 6 stones. Harris decides to go first and provides the number 2 to Anton. Anton adds 2 stones to the third pile, which results in 5, 2, and 8.

In the next turn, Harris chooses 3. Note that Anton cannot add the stones to the third pile since he chose the third pile in the previous turn. Anton realizes that he has no valid moves left and reluctantly recognizes Harris as the king.

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;

public class global9f {
	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		int[] arr=new int[3], sort=new int[3];
		for(int i=0;i<3;i++) {
			arr[i]=scan.nextInt();
			sort[i]=arr[i];
		}
		Arrays.sort(sort);
		
		int[] map=new int[3];
		for(int i=0;i<3;i++) {
			for(int j=0;j<3;j++) {
				if(arr[i]==sort[j]) map[i]=j;
			}
		}
//		System.out.println(Arrays.toString(map));
		
		long a=sort[0], b=sort[1], c=sort[2];
		/*
		the three piles are a, b, c s.t. a<b<c
		player 2 is in trouble iff b-a = c-b and c was the last pile chosen
		cuz then player 1 can say y=b-a and it's all over
		
		if a or b is chosen
		it is sufficient to set y=2c-a-b
		because this will result in either
		b, c, 2c-b (dif=c-b)
		or
		a, c, 2c-a (dif=c-a)
		
		if c is chosen
		it cannot be chosen again on the next turn
		and so we are guaranteed a win in the next move;)
		*/
		
		q("First");
		q(2*c-a-b);
		
		int pile=map[scan.nextInt()-1];
		
		if(pile==0) {
			q(c-b);
			scan.nextInt();
			return;
		}
		else if(pile==1) {
			q(c-a);
			scan.nextInt();
			return;
		}
		else {
			/*
			now the piles are equal to a, b, 3c-a-b
			let x=3c-a-b
			then we need y=2x-a-b
			*/
			
			long x=3*c-a-b;
			q(2*x-a-b);
			
			int pile2=map[scan.nextInt()-1];
			
			if(pile2==0) {
				q(x-b);
				scan.nextInt();
				return;
			}
			else {
				q(x-a);
				scan.nextInt();
				return;
			}
		}
	}
	public static void q(String query) {
		System.out.println(query);
		System.out.flush();
	}
	public static void q(long query) {
		System.out.println(query);
		System.out.flush();
	}
}