#include <bits/stdc++.h>
using namespace std;
void solve() {
  pair<long long, long long> p[4];
  cin >> p[1].first >> p[2].first >> p[3].first;
  map<long long, long long> m;
  for (long long i = 1; i <= 3; i++) p[i].second = i;
  sort(p + 1, p + 4);
  for (long long i = 1; i <= 3; i++) m[p[i].second] = i;
  long long out = 2 * p[3].first - p[1].first - p[2].first;
  cout << "First" << endl;
  cout << out << endl;
  long long in;
  cin >> in;
  if (m[in] == 3) {
    p[3].first += out;
    long long out = 2 * p[3].first - p[1].first - p[2].first;
    cout << out << endl;
    long long in;
    cin >> in;
    if (m[in] == 1) {
      long long out = p[3].first - p[2].first;
      cout << out << endl;
      long long in;
      cin >> in;
    } else {
      long long out = p[3].first - p[1].first;
      cout << out << endl;
      long long in;
      cin >> in;
    }
  } else {
    if (m[in] == 1) {
      long long out = p[3].first - p[2].first;
      cout << out << endl;
      long long in;
      cin >> in;
    } else {
      long long out = p[3].first - p[1].first;
      cout << out << endl;
      long long in;
      cin >> in;
    }
  }
}
int main() {
  int q = 1;
  for (int i = 1; i <= q; i++) {
    solve();
  }
  return 0;
}
