#include #ifdef LOCAL #include #else #define debug(...) void(0) #endif using namespace std; typedef long long ll; #define all(x) begin(x), end(x) constexpr int INF = (1 << 30) - 1; constexpr long long IINF = (1LL << 60) - 1; constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; template istream& operator>>(istream& is, vector& v) { for (auto& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, const vector& v) { auto sep = ""; for (const auto& x : v) os << exchange(sep, " ") << x; return os; } template bool chmin(T& x, U&& y) { return y < x and (x = forward(y), true); } template bool chmax(T& x, U&& y) { return x < y and (x = forward(y), true); } template void mkuni(vector& v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template int lwb(const vector& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); } int a[2]; void query(int type, int i, int x) { if (type == 0) { assert(x <= a[i]); cout << "A " << i + 1 << ' ' << x; } else cout << 'B'; cout << endl; char c; cin >> c; if (c != 'A') exit(0); cin >> i >> x; a[--i] -= x; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> a[0] >> a[1]; if (a[0] == a[1]) { cout << "First" << endl; query(1, -1, -1); return 0; } for (int k = 0; k < 2; k++) { if (a[k] == 1) { if (a[k ^ 1] == 2) cout << "Second" << endl; else { cout << "First" << endl; query(0, k ^ 1, a[k ^ 1] - 2); } char c; cin >> c; if (c != 'A') exit(0); int i, x; cin >> i >> x; a[--i] -= x; if (a[0] == a[1]) { query(1, -1, -1); return 0; } else { assert(a[0] == 0 or a[1] == 0); if (a[0] > 0) query(0, 0, a[0]); else query(0, 1, a[1]); return 0; } } } while (true) { int m = min(a[0], a[1]); if (a[0] == a[1]) { query(1, -1, -1); return 0; } if (a[0] == 0) { query(0, 1, a[1]); return 0; } if (a[1] == 0) { query(0, 0, a[0]); return 0; } for (int i = 0; i < 2; i++) { if (a[i] != m) { query(0, i, a[i] - (m - 1)); } } } return 0; }