import math

def prime(a):
  for i in range(2,int(math.sqrt(a))+1):
    if a%i==0:
      return False
  return True

def solve(a):
  res=a+1
  while True:
    if prime(res):
      return res-a-1
    else:
      res+=1

x,y=map(int,input().split())

ans=solve(x)+solve(y)

if ans%2==0:
  print("Second")
else:
  print("First")