import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = input
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda : list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
getEdges = lambda n : [[x - 1 for x in getNs()] for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0];  dy = [0, 1, 0, -1]
#di = coll.defaultdict(int)
 
 
"""
Main Code
"""

a = getList()

def input_judge(a):
    lis = list(map(str, inp().split()))
    if(lis[0] == 'A'):
        i, x = int(lis[1]) - 1, int(lis[2])
        a[i] -= x
    elif(lis[0] == 'B'):
        a[0] = a[1] = 0
    else:
        exit(0)

k = (a[0] > a[1])
if(a[k] & 1 and a[k] + 1 == a[k ^ 1]):
    print("Second")
    input_judge(a)
else:
    print("First")

while(True):
    if(a[0] == a[1]):
        print('B')
    else:
        k = (a[0] > a[1])
        x = a[k ^ 1]
        if(a[k] > 0):
            x = a[k ^ 1] - a[k] - 1 if(a[k] & 1) else a[k ^ 1] - a[k] + 1
        print('A', (k ^ 1) + 1, x)
    input_judge(a)