n,k=map(int,input().split())
a=list(map(int,input().split()))
dp=[[0]*2 for _ in range(k+1)]
for i in range(a[0]):dp[i][0]=1
for i in range(k):
  for j in range(2):
    for x in a:
      if not ((i+x) in range(k+1)):continue
      dp[i+x][(j+1)%2]=max(dp[i+x][(j+1)%2],dp[i][j])
if dp[-1][1]: print("First")
else:print("Second")