n,k=map(int,input().split())
a=list(map(int,input().split()))
dp=[0]*(k+1)
for i in range(k+1):
  for j in range(n):
    if i-a[j]>=0:
      if dp[i-a[j]]==0:
        dp[i]=1
        break
if dp[k]:print('First')
else:print('Second')