import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X,Y = map(int,read().split())

def MillerRabinTest(n, maxiter = 10):
    import random
    if n == 1:
        return False
    elif n == 2:
        return True
    if not n&1:
        return False
    
    d = n - 1
    while not (d & 1):
        d >>= 1
        
    for _ in range(maxiter):
        a = random.randint(1,n-1)
        t = d
        x = pow(a,t,n)
        while (t != n-1) and (x != 1) and (x != n - 1):
            x = x * x % n
            t <<= 1
        if (x != n-1) and not (t & 1):
            return False
    return True

def next_prime(n):
    while True:
        n += 1
        if MillerRabinTest(n):
            return n

is_prime = [MillerRabinTest(x) for x in [X,Y]]

if is_prime[0] and is_prime[1]:
    print('Second')
elif X == 2 or Y == 2:
    print('Second')
else:
    dx = next_prime(X) - X - 1
    dy = next_prime(Y) - Y - 1
    if (dx + dy) & 1:
        print('First')
    else:
        print('Second')