/* -*- coding: utf-8 -*-
 *
 * 2521.cc:  No.2521 Don't be Same - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* subroutines */

int read(int &i, int &z) {
  char op[4];
  scanf("%s", op);

  i = z = -1;
  if (op[0] == 'A') scanf("%d%d", &i, &z), i--;
  return op[0] - 'A';
}

/* main */

int main() {
  int x, y;
  scanf("%d%d", &x, &y);

  if (((x & 1) && y == x + 1) || ((y & 1) && x == y + 1)) {
    puts("Second"); fflush(stdout);

    int i, z;
    int r = read(i, z);
    if (r >= 2) return 0;
    if (i == 0) x -= z;
    else y -= z;
  }
  else {
    puts("First"); fflush(stdout);
  }

  while (x > 0 || y > 0) {
    if (x == y) {
      puts("B");
      x = y = 0;
    }
    else if (x == 0) {
      printf("A 2 %d\n", y);
      y = 0;
    }
    else if (y == 0) {
      printf("A 1 %d\n", x);
      x = 0;
    }
    else if (x < y) {
      int z = (x & 1) ? y - (x + 1) : y - (x - 1);
      printf("A 2 %d\n", z);
      y -= z;
    }
    else { // x > y
      int z = (y & 1) ? x - (y + 1) : x - (y - 1);
      printf("A 1 %d\n", z);
      x -= z;
    }
    fflush(stdout);

    int i, z;
    int r = read(i, z);

    if (r >= 2) break;
    if (i == 0) x -= z;
    else y -= z;
  }

  return 0;
}