N,K=map(int,input().split())
a=list(map(int,input().split()))
grundy=[0]*(K+1)
for j in range(K+1):
    s=set()
    for i in range(N):
        if a[i]<=j:
            s.add(grundy[j-a[i]])
    g=0
    s=list(s)
    if s!=[]:
        while g<len(s) and g==s[g]:
            g+=1
    grundy[j]=g
if grundy[K]:print("First")
else:print("Second")