import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


Y,X = MI()


def is_prime(a):
    if a == 1:
        return False
    for i in range(2,int(a**.5)+1):
        if a % i == 0:
            return False
    return True


for i in range(Y+1,10**10):
    if is_prime(i):
        pY = i
        break

for i in range(X+1,10**10):
    if is_prime(i):
        pX = i
        break

if is_prime(X) and is_prime(Y):
    print('Second')
elif X == 2 or Y == 2:
    print('Second')
elif (pX-X+pY-Y) % 2 == 0:
    print('Second')
else:
    print('First')