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;
int dp[51][51][2];
void solve() {
  int n1, n2, k1, k2;
  cin >> n1 >> n2 >> k1 >> k2;
  for (int i = 0; i <= n1; i++) {
    for (int j = 0; j <= n2; j++) {
      for (int s = 1; s <= k1 && s <= i; s++) {
        if (!dp[i - s][j][1]) {
          dp[i][j][0] = 1;
        }
      }
      for (int s = 1; s <= k2 && s <= j; s++) {
        if (!dp[i][j - s][0]) {
          dp[i][j][1] = 1;
        }
      }
    }
  }
  if (dp[n1][n2][0]) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
int main() {
  if (0) freopen("input.txt", "rt", stdin);
  if (0) freopen("output.txt", "wt", stdout);
  solve();
}
