#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 9;
const int M = 1e3 + 9;
const int INFINT = 1e9 + 9;
const long long INFLL = 1e18 + 9;
const long long MOD = 998244353ll;
void solve() {
  pair<long long, long long> m[3];
  cin >> m[0].first >> m[1].first >> m[2].first;
  m[0].second = 1;
  m[1].second = 2;
  m[2].second = 3;
  cout << "First" << endl;
  int ind = -1;
  while (true) {
    sort(m, m + 3);
    long long first = m[2].first * 2 - m[1].first - m[0].first;
    if (m[2].second == ind &&
        m[2].first - m[1].first == m[1].first - m[0].first)
      cout << m[2].first - m[1].first << endl;
    else
      cout << first << endl;
    cin >> ind;
    if (ind <= 0) return;
    if (m[0].second == ind) m[0].first += first;
    if (m[1].second == ind) m[1].first += first;
    if (m[2].second == ind) m[2].first += first;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  srand(time(nullptr));
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
