import math

def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    w = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += w
        w = 6 - w
    return True

def is_prime_cell(y, x):
    return is_prime(y) or is_prime(x)

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

# Check if current position is a dead end (both next moves are primes)
move_up_prime = is_prime_cell(Y+1, X)
move_right_prime = is_prime_cell(Y, X+1)

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