#include <bits/stdc++.h>
using namespace std;
int a, b;
int dp[55][55][4];
int f(int n, int m, int p) {
  if ((n == m && n == 0) || (n == 0 && p == 1) || (m == 0 && p == 2)) {
    return dp[n][m][p] = 0;
  }
  if (dp[n][m][p] != -1) {
    return dp[n][m][p];
  }
  bool g = 0;
  if (p == 1) {
    for (int i = 1; i <= min(a, n); i++) {
      g = (g || (!f(n - i, m, 2)));
    }
  } else {
    for (int i = 1; i <= min(b, m); i++) {
      g = (g || (!f(n, m - i, 1)));
    }
  }
  return dp[n][m][p] = g;
}
int main() {
  int n, m;
  cin >> n >> m >> a >> b;
  memset(dp, -1, sizeof(dp));
  if (f(n, m, 1)) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
