import random

def is_prime(n):
    if n < 2:
        return False
    for p in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]:
        if n % p == 0:
            return n == p
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:
        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

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

y_prime = is_prime(Y)
x_prime = is_prime(X)

is_start_prime = y_prime or x_prime

if not is_start_prime:
    # Check if both next steps are primes
    y_plus1 = Y + 1
    x_plus1 = X + 1
    if is_prime(y_plus1) and is_prime(x_plus1):
        print("Second")
    else:
        print("First")
else:
    directions = []
    # Check possible moves to non-prime cells
    if y_prime:
        y_next = Y + 1
        if not is_prime(y_next) and not x_prime:
            directions.append( (y_next, X) )
    if x_prime:
        x_next = X + 1
        if not is_prime(x_next) and not y_prime:
            directions.append( (Y, x_next) )
    
    if not directions:
        print("Second")
    else:
        can_win = False
        for (y, x) in directions:
            # Check next steps from (y, x)
            yp = y + 1
            xp = x + 1
            if not (is_prime(yp) and is_prime(xp)):
                can_win = True
                break
        print("First" if can_win else "Second")