import sys
sys.setrecursionlimit(10**6)

N,K = map(int,input().split())
ali = list(map(int,input().split()))
dp = [-1]*(K+1)
#0=lose 1=win
#メモ化再帰

def fight(st):
  if dp[st] != -1:
    return dp[st]
  if st < min(ali):
    dp[st] = 0
    return 0
  a = 1
  for i in range(N):
    a = min(a,fight(st-ali[i]))
    
  dp[st] = 1-a
  return 1-a

if fight(K) == 1:
  print("First")
else:
  print("Second")