n,k=map(int,input().split())
steps=list(map(int,input().split()))
dp=[True]*(k+1)
dp[0]=False
for stone in range(1,k+1):
  for s in steps:
    if s<=stone:
      dp[stone]=dp[stone]and dp[stone-s]
    else:
      break
  dp[stone]=not dp[stone]
#print(dp)
if dp[k]:
  print('First')
else:
  print('Second')
  