import sys sys.setrecursionlimit(10 ** 6) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def SI(): return sys.stdin.readline()[:-1] def MI(): return map(int, sys.stdin.readline().split()) def MI1(): return map(int1, sys.stdin.readline().split()) def MF(): return map(float, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LF(): return list(map(float, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] dij = [(0, 1), (1, 0), (0, -1), (-1, 0)] def isprime(a): if a<2:return False if a<4:return True if a%2==0:return False for d in range(3,a+5,2): if d**2>a:return True if a%d==0:return False def main(): inf=10**10 y,x=MI() if isprime(x) and isprime(y): print("Second") exit() for a in range(x+1,inf): if isprime(a):break xp=a for a in range(y+1,inf): if isprime(a):break yp=a if (xp-x+yp-y)%2:print("First") else:print("Second") main()