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

def solve( x , y , o ):
    if status[x][y][o] != -1:
        return status[x][y][o]
    
    if x == 0:
        status[x][y][o] = 0
        return 0

    if y == 0:
        status[x][y][o] = 1
        return 1

    if o == 0:
        for i in range( 1 , min(k1,x)+1 ):
            if solve( x-i , y , 1 ) == 1:
                status[x][y][o] = 1
                return 1
        status[x][y][o] = 0
        return 0

    if o == 1:
        for i in range( 1 , min(k2,y)+1 ):
            if solve( x , y-i , 0 ) == 1:
                status[x][y][o] = 1
                return 1
        status[x][y][o] = 0
        return 0
    

n1,n2,k1,k2 = [int(x) for x in input().strip().split()]

status = []
for i in range(0,n1+1):
    oneStatus = []
    for j in range(0,n2+1):
        oneStatus.append( [-1,-1] )
    status.append( oneStatus )

if solve( n1 , n2 , 0 ):
    print("First")
else:
    print("Second")
