50 50 50 50
 49 49 4 1
 48 50 12 11
 5 7 1 10
 1 50 50 50
 5 7 1 4
 32 4 17 3
 1 50 1 50
 50 1 1 1
 32 31 10 9
 5 7 4 1
 49 49 3 3
 50 49 1 2
 50 48 3 1
 50 1 1 50
 5 7 10 10
 1 1 1 1
 49 50 11 12

Second
 Second
 Second
 Second
 Second
 Second
 First
 Second
 First
 First
 Second
 Second
 First
 First
 First
 Second
 Second
 Second

#include <bits/stdc++.h>
using namespace std;
const int maxn = 51;
int n1, n2, k1, k2;
int d[2][maxn][maxn];
int rec(int p, int n1, int n2) {
  if (p == 0 && n1 == 0) return 1;
  if (p == 1 && n2 == 0) return 0;
  if (d[p][n1][n2] != -1) return d[p][n1][n2];
  int ans = 1 - p;
  if (p == 0) {
    for (int i = 1; i <= max(n1, k1); i++) {
      if (rec(1, n1 - i, n2) == 0) {
        ans = 0;
        break;
      }
    }
  } else {
    for (int i = 1; i <= max(n2, k2); i++) {
      if (rec(0, n1, n2 - i) == 1) {
        ans = 1;
        break;
      }
    }
  }
  return d[p][n1][n2] = ans;
}
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  memset(d, 0xff, sizeof(d));
  int res = rec(0, n1, n2);
  if (res == 0)
    cout << "First";
  else
    cout << "Second";
  cout << endl;
  return 0;
}
