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 n1, n2, k1, k2;
int winF[100];
int winS[100];
set<int> qs;
set<int> qf;
int main() {
  cin >> n1 >> n2 >> k1 >> k2;
  for (int i = 1; i <= max(n1, n2); i++) {
    for (int j = 0; j <= 50; j++) qs.insert(j), qf.insert(j);
    for (int j = i - k1; j <= i - 1; j++) qf.erase(winS[j]);
    for (int j = i - k2; j <= i - 1; j++) qs.erase(winF[j]);
    winF[i] = *qf.begin();
    winS[i] = *qs.begin();
  }
  if (winF[n1] ^ winF[n2])
    puts("First");
  else
    puts("Second");
}
