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

#!/usr/bin/python

def memoize(f):
    cache= {}
    def memf(*x):
        if x not in cache:
            cache[x] = f(*x)
        return cache[x]
    return memf

import sys

def Ni(): return tuple(map(int, sys.stdin.readline().split()))

n1, n2, k1, k2 = Ni()

# return true if first player wins
@memoize
def firstWin(n1, n2, firstPlayerTurn):
    if firstPlayerTurn:
        if n1 == 0:
            return False
        for k in range(1, k1+1):
            if firstWin(n1 - k, n2, False):
                return True
        return False
    else:
        if n2 == 0:
            return True
        for k in range(1, k2+1):
            if not firstWin(n1, n2 - k, True):
                return False
        return True

print "First" if firstWin(n1, n2, True) else "Second"

#
# Wait... this seems like a silly problem.  Isn't the optimal
# strategy to just pick 1 every time, and have player 1 win
# if n1 > n2?
#
