Y, X = map(int, input().split())
def prime(n):
    seq = list(range(2, n))
    while len(seq) > 0:
        p = seq.pop(0)
        yield p
        if n ** 0.5 >= p:
            seq = [i for i in seq if i % p != 0]
ps = set(prime(10 ** 5))

def f(v):
    for i in range(10 ** 10):
        if (v + i) in ps:
            return i
        for p in ps:
            if (v + i) % p == 0:
                break
        else:
            return i
dx = f(X)
dy = f(Y)
print('Second' if (dx + dy) % 2 == 0 else 'First')