import math
import bisect
#x未満の素数
def primes(x):
	if x<2: return []
	input_list=[False if i % 2==0 or i % 3 ==0 or i % 5 == 0 else True for i in range(x)]
	input_list[0] = input_list[1] = False
	if x>2: input_list[2]=True
	if x>3: input_list[3]=True
	if x>5: input_list[5]=True
	
	sqrt = math.sqrt(x)

	for prime in range(3,x,2):
		if prime>=sqrt:
			break
		if not input_list[prime]:
			continue
		for s in range(prime ** 2,x,prime):
			input_list[s]=False

	return [i for i, b in enumerate(input_list) if b == True]

x,y=input().split()
x=int(x)
y=int(y)

p=primes(int(math.sqrt(10**9))+1)

def ans(x,y):
	flag=True
	x,y=min(x,y),max(x,y)
	if x==1:
		if y==1 or y==2:
			return flag
		else:
			x+=1
			flag = not flag
	if x==2:
		if y==1 or y==2:
			return flag
		else:
			x+=1
			flag = not flag

	if x%2 + y%2 ==1:
		flag = not flag
	else:
		flag=flag

	return flag

if ans(x,y):
	print("Second")
else:
	print("First")