#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

// struct io_setup {
//     io_setup() {
//         ios_base::sync_with_stdio(false);
//         cin.tie(NULL);
//         cout << fixed << setprecision(15);
//         cerr << fixed << setprecision(15);
//     }
// } io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

void solve() {
    // int N;
    // cin >> N;

    // vector<vector<int>> f(N + 1, vector<int>(N + 1, 0));

    // rep2(i, 0, N + 1) rep2(j, 0, N + 1) {
    //     if (i == 0 && j == 0) continue;
    //     if (i == j) f[i][j] = 1;
    //     rep(k, j) {
    //         if (f[i][k] == 0) f[i][j] = 1;
    //     }
    //     rep(k, i) {
    //         if (f[k][j] == 0) f[i][j] = 1;
    //     }
    // }

    // rep(i, N + 1) rep2(j, i + 1, N + 1) {
    //     if (f[i][j] == 0) cout << i MM j << '\n';
    // }

    int X, Y;
    cin >> X >> Y;

    auto judge = [&](int x, int y) {
        if (x > y) swap(x, y);
        if (y == x + 1 && x % 2 == 1) return false;
        return true;
    };

    auto input = [&]() {
        char c;
        cin >> c;
        if (c == 'C') exit(0);
        if (c == 'D') assert(false);
        if (c == 'A') {
            int i, x;
            cin >> i >> x;
            (i == 1 ? X : Y) -= x;
        }
        if (c == 'B') assert(false);
    };

    if (!judge(X, Y)) {
        cout << "Second" << endl;
        input();
    } else {
        cout << "First" << endl;
    }

    auto move = [&]() {
        if (X == Y) {
            cout << "B" << endl;
            X = 0, Y = 0;
            return;
        }
        if (X == 0) {
            cout << "A 2 " << Y << endl;
            Y = 0;
            return;
        }
        if (Y == 0) {
            cout << "A 1 " << X << endl;
            X = 0;
            return;
        }

        if (X > Y) {
            if (Y % 2 == 0) {
                cout << "A 1 " << X - (Y - 1) << endl;
                X = Y - 1;
            } else {
                cout << "A 1 " << X - (Y + 1) << endl;
                X = Y + 1;
            }
        } else {
            if (X % 2 == 0) {
                cout << "A 2 " << Y - (X - 1) << endl;
                Y = X - 1;
            } else {
                cout << "A 2 " << Y - (X + 1) << endl;
                Y = X + 1;
            }
        }
    };

    while (true) {
        move();
        input();
        if (X == 0 && Y == 0) break;
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}