def is_prime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0:
        return False
    # Write n-1 as d*2^s
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    # Test for bases 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, and 37
    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):
    # Check if moving up leads to a prime cell
    cond1 = is_prime(Y + 1) or is_prime(X)
    # Check if moving right leads to a prime cell
    cond2 = is_prime(Y) or is_prime(X + 1)
    if cond1 and cond2:
        return "Second"
    else:
        return "First"

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