#dp[i]denotes who will win if i stones left
import sys
sys.setrecursionlimit(10**6)
def f(i):
	global xi
	if(i<m):
		return 2
	if(i in xi):
		return xi[i]
	done=0
	for j in hashi:
		if(j<=i):
			if(f(i-j)==2):
				xi[i]=1
				done=1
				return 1
	if(done==0):
		xi[i]=2
	return 2
l=input().split()
n=int(l[0])
k=int(l[1])
l=input().split()
li=[int(i) for i in l]
hashi=dict()
for i in li:
	hashi[i]=1
m=min(li)
xi=dict()
if(f(k)==1):
	print("First")
else:
	print("Second")