import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



bool solve(int x, int y) {
  if (x > y) swap(x, y);
  return !((x == 0 && y == 0) || x + 1 == y && x % 2 != 0);
}

void main() {
  debug {{
    enum lim = 40;
    auto dp = new bool[][](lim, lim);
    foreach (x; 0 .. lim) foreach (y; 0 .. lim) {
      foreach (xx; 0 .. x) if (!dp[xx][y]) dp[x][y] = true;
      foreach (yy; 0 .. y) if (!dp[x][yy]) dp[x][y] = true;
      if (x && x == y) dp[x][y] = true;
    }
    foreach (x; 0 .. lim) {
      foreach (y; 0 .. lim) write(dp[x][y] ? 1 : 0);
      writeln;
    }
    foreach (x; 0 .. lim) foreach (y; 0 .. lim) {
      assert(dp[x][y] == (solve(x, y) ? 1 : 0));
    }
  }}
  
  int x = readInt;
  int y = readInt;
  int turn = solve(x, y) ? 1 : 0;
  writeln(turn ? "First" : "Second");
  stdout.flush;
  for (; ; turn ^= 1) {
    if (turn) {
      if (x && x == y) {
        writeln("B");
        stdout.flush;
        x = y = 0;
      } else {
        bool check(int xx, int yy) {
          if (0 <= xx && xx < x && yy == y) {
            writeln("A 1 ", x - xx);
            stdout.flush;
            x = xx;
            return true;
          }
          if (0 <= yy && yy < y && xx == x) {
            writeln("A 2 ", y - yy);
            stdout.flush;
            y = yy;
            return true;
          }
          return false;
        }
        if (check(x, x - 1)) continue;
        if (check(x, x + 1)) continue;
        if (check(y - 1, y)) continue;
        if (check(y + 1, y)) continue;
        assert(false);
      }
    } else {
      const o = readToken;
      if (o == "A") {
        const i = readInt;
        const z = readInt;
        ((i == 1) ? x : y) -= z;
      } else if (o == "C") {
        break;
      } else {
        assert(false);
      }
    }
  }
}