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

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

y_plus_1_prime = is_prime(Y + 1)
x_prime = is_prime(X)
y_prime = is_prime(Y)
x_plus_1_prime = is_prime(X + 1)

cond_a = y_plus_1_prime or x_prime
cond_b = y_prime or x_plus_1_prime

print("Second" if cond_a and cond_b else "First")