import sys
sys.setrecursionlimit(1000000)

n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
dp = [-1]*100001
# dp[100000] = 0

def mex(l):
    l=list(set(l))
    d={}
    for i in l:
        d[i] = 1
    x=len(l)
    for i in range(0,len(l)):
        try :
            d[i] = d[i] + 1
        except:
            x=i
            break
    return x

def grundy(a,k):
    h = min(a)
    if k<h:
        return 0
    if k==h:
        return 1

    if dp[k]!=-1:
        return dp[k]
    
    dp[k] = mex([grundy(a,k-i) for i in a if k-i>=0])
    return dp[k]

if grundy(a,k) == 0:
    print("Second")
else:
    print("First")



# n=int(input())

# dp = [-1]*(1000001)
# dp[1] = 1

# for i in range(2,n):
#     if dp[i]!=-1:
#         break
#     x=min(6,i)
#     m=0
#     for j in range(1,x):
#         m=m+dp[i-j]
#     dp[i]=m
# print(dp[i])