from collections import *
import sys
import heapq
import bisect
import itertools
from functools import lru_cache
import math

# sys.setrecursionlimit(int(1e7))

dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
MOD2 = 10**9 + 7
mod2 = 10**9 + 7
# memo : len([a,b,...,z])==26

input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int, input().split())
li = lambda: list(mi())


N, M = mi()
if M == 1:
    print("First")
    exit()
win = pow(N, M - 2, 2)
if win:
    print("First")
else:
    print("Second")