import math

def is_prime(n):
    if n <= 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.isqrt(n)) + 1, 2):
        if n % i == 0:
            return False
    return True

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

# Check if moving up (Y+1, X) is a prime cell
move_up_prime = is_prime(Y + 1) or is_prime(X)

# Check if moving right (Y, X+1) is a prime cell
move_right_prime = is_prime(Y) or is_prime(X + 1)

if move_up_prime and move_right_prime:
    print("Second")
else:
    print("First")