import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets import critbits, future, strformat, deques template `max=`(x,y) = x = max(x,y) template `min=`(x,y) = x = min(x,y) template `mod=`(x,y) = x = x mod y template scan2 = (scan(), scan()) template scan3 = (scan(), scan()) let read* = iterator: string {.closure.} = while true: (for s in stdin.readLine.split: yield s) proc scan(): int = read().parseInt proc scanf(): float = read().parseFloat proc toInt(c:char): int = return int(c) - int('0') proc isPrime(n:int):bool= if n==1: return false if n==2: return true var d = 2 while d^2<=n: if n.mod(d)==0: return false d+=1 return true proc solve()= var y = scan() x = scan() yp = 0 xp = 0 for p in y+1..10^9+7: if isPrime(p): yp=p break for p in x+1..10^9+7: if isPrime(p): xp=p break var move = (xp-x)*(yp-y)-1 if move.div(2)==0: echo "Second" else: echo "First" solve()