#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 100;
const int INF = 1e9;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c;
  cin >> a >> b >> c;
  vector<long long> s = {a, b, c};
  vector<long long> second = {a, b, c};
  sort(s.begin(), s.end());
  cout << "First" << endl;
  while (1) {
    long long y = s.back() + s.back() - s[0] - s[3 >> 1];
    cout << y << endl;
    int q;
    cin >> q;
    q--;
    if (second[q] == s[1]) {
      cout << s.back() - *s.begin() << endl;
      return 0;
    }
    if (second[q] == s[0]) {
      cout << s.back() - *(s.begin() + 1) << endl;
      return 0;
    }
    s[2] += y;
  }
  return 0;
}
