def prime(a):
  if a==1:
    return False
  if a==2:
    return True

  for i in range(2,a+1):
    if a%i==0:
      return False
    if i*i>a:
      break
  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 prime(x) and prime(y):
  print("Second")
elif ans%2==0:
  print("Second")
else:
  print("First")