from functools import lru_cache


@lru_cache(maxsize=None)
def isPrime(n):
    if n == 0 or n == 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(n ** 0.5) + 1, 2):
        if n % i == 0:
            return False
    return True


def find_prime(x):
    x += 1
    for _ in range(5 * 10 ** 6):
        if isPrime(x):
            return x
        x += 1
    return -1


X, Y = map(int, input().split())
if isPrime(X) and isPrime(Y):
    print("Second")
    exit()

if isPrime(X):
    X, Y = Y, X
if isPrime(Y):
    move = find_prime(Y) - Y - 1
    if move % 2 == 0:
        print("Second")
    else:
        print("First")
    exit()

dx = find_prime(X) - X - 1
dy = find_prime(Y) - Y - 1
if (dx + dy) % 2 == 0:
    print("Second")
else:
    print("First")