def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0:
        return False
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    # Test for bases that cover up to 1e18
    bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
    for a in bases:
        if a >= n:
            continue
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True

def determine_winner(Y, X):
    Y_plus = Y + 1
    X_plus = X + 1

    # Check condition1: (Y+1, X) is a prime cell
    condition1 = is_prime(Y_plus) or is_prime(X)
    
    # Check condition2: (Y, X+1) is a prime cell
    condition2 = is_prime(Y) or is_prime(X_plus)
    
    if condition1 and condition2:
        return "Second"
    else:
        return "First"

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

# Determine and print the result
print(determine_winner(Y, X))