MOD = 10 **9 + 7 INF = 10 ** 10 def is_prime(n): if n == 1: return False for i in range(2,n): if i * i > n: break if n%i == 0: return False return True def main(): y,x = map(int,input().split()) if is_prime(x) and is_prime(y): print('Second') return if is_prime(x): x += 1 h,w = 0,1 while not is_prime(y): h += 1 y += 1 while not is_prime(x): w += 1 x += 1 elif is_prime(y): y += 1 h,w = 1,0 while not is_prime(y): h += 1 y += 1 while not is_prime(x): w += 1 x += 1 else: x += 1 y += 1 h,w = 0,0 while not is_prime(y): h += 1 y += 1 while not is_prime(x): w += 1 x += 1 if (h + w)%2 == 0: print('Second') else: print('First') if __name__ == '__main__': main()