import math def is_prime(n): if n <= 1: return False if n == 2: return True if n % 2 == 0: return False for i in range(3, int(math.isqrt(n)) + 1, 2): if n % i == 0: return False return True Y, X = map(int, input().split()) cond1 = is_prime(Y + 1) or is_prime(X) cond2 = is_prime(Y) or is_prime(X + 1) if cond1 and cond2: print("Second") else: print("First")