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

#Q1

def solution(n1, n2, k1, k2):
    min_times1 = min_times2 = 0
    if n1 <= k1:
        min_times1 = 1
    else:
        if n1 % k1 == 0:
            min_times1 = n1 / k1
        else:
            min_times1 = n1 / k1 + 1

    if n2 <= k2:
        min_times2 = 1
    else:
        if n2 % k2 == 0:
            min_times2 = n2 / k2
        else:
            min_times2 = n2 / k2 + 1
    print min_times1, min_times2
    if min_times1 <= min_times2 + 1:
        return "First"
    else:
        return "Second"


a = raw_input("")
a = a.split(" ")
print solution(int(a[0]), int(a[1]), int(a[2]), int(a[3]))
