#include <bits/stdc++.h>
using namespace std;
long long a[4];
vector<int> order, to;
bool cmp(int x, int y) { return a[x] < a[y]; }
int main() {
  cin >> a[1] >> a[2] >> a[3];
  order = {1, 2, 3};
  sort(order.begin(), order.end(), cmp);
  to = order;
  cout << "First" << endl;
  for (;;) {
    long long w = 2 * a[to[2]] - a[to[1]] - a[to[0]];
    cout << w << endl;
    int ps;
    cin >> ps;
    if (ps == 0) return 0;
    a[ps] += w;
    if (ps == to[0]) {
      w = a[to[2]] - a[to[1]];
      cout << w << endl;
      cin >> ps;
      if (ps == 0) return 0;
      a[ps] += w;
    } else if (ps == to[1]) {
      w = a[to[2]] - a[to[0]];
      cout << w << endl;
      cin >> ps;
      if (ps == 0) return 0;
      a[ps] += w;
    }
  }
  return 0;
}
