#include <bits/stdc++.h>
using namespace std;
long long a[4];
void work() {
  for (int i = 1; i <= 3; ++i) {
    if (a[i] == max(a[1], max(a[2], a[3]))) {
      int j = 1, k = 2;
      if (i == j) j = 3;
      if (i == k) k = 3;
      cout << (a[i] - a[j]) + (a[i] - a[k]) << endl;
      int l;
      cin >> l;
      assert(l != i);
      if (l == 0) return;
      if (l == k) swap(j, k);
      a[j] += (a[i] - a[j]) + (a[i] - a[k]);
      cout << a[i] - a[k] << endl;
      cin >> l;
      assert(l == 0);
      return;
    }
  }
}
int main() {
  cin >> a[1] >> a[2] >> a[3];
  cout << "First" << endl;
  for (int i = 1; i <= 3; ++i) {
    if (a[i] == max(a[1], max(a[2], a[3]))) {
      int j = 1;
      if (i == 1) j = 2;
      cout << a[i] - a[j] << endl;
      int k;
      cin >> k;
      a[k] += a[i] - a[j];
      assert(k != j);
      if (k == 0)
        return 0;
      else if (k == i)
        work();
      else {
        if (a[k] > a[i])
          work();
        else {
          cout << a[i] - a[j] << endl;
          int l;
          cin >> l;
          a[l] += a[i] - a[j];
          assert(l != k);
          assert(l != j);
          if (l == 0)
            return 0;
          else
            work();
        }
      }
      return 0;
    }
  }
  return 0;
}
