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 long long mod = 1e9 + 7, SZ = 10000007;
int nxt[200009];
char a[200][200];
int n, m, k, vid;
vector<int> spf(SZ);
vector<int> primes;
void sieve() {
  for (int i = 1; i < SZ; i++) spf[i] = i;
  for (long long i = 2; i * i < SZ; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < SZ; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
int primeFactors(int n) {
  set<int> v;
  while (n != 1) {
    v.insert(spf[n]);
    n /= spf[n];
  }
  return v.size();
}
vector<int> v;
void solve(int n) {
  if (n > 1e6) return;
  if (n) v.push_back(n);
  solve(n * 10);
  solve(n * 10 + 1);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n1, n2, k1, k2;
  cin >> n1 >> n2 >> k1 >> k2;
  if (n1 > n2)
    cout << "First";
  else
    cout << "Second";
}
