n,k=list(map(int,input().split()))

a=list(map(int,input().split()))

ans = [False]*(k+1)

for i in range(1,k+1):

    ok = False

    for j in a:

        if i-j<0:

            continue

        if ans[i-j] == False:

            ans[i] = True

            break



print(('First' if ans[k] else 'Second'))
n,k=list(map(int,input().split()))

a=list(map(int,input().split()))

dp=[0]*(k+1+1234)



for i in range(0,k+1):

    if dp[i] == 0:

        for x in a:

            dp[min(i+x,k+1)] =1



print(("First" if dp[k] else "Second"))
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = [False] * (k + 1)
for i in range(1, k + 1):
    ok = False
    for j in a:
        if i - j < 0:
            continue
        if ans[i - j] == False:
            ans[i] = True
            break
print(("First" if ans[k] else "Second"))

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (k + 1 + 1234)
for i in range(0, k + 1):
    if dp[i] == 0:
        for x in a:
            dp[min(i + x, k + 1)] = 1
print(("First" if dp[k] else "Second"))

-ans = [False] * (k + 1) -for i in range(1, k + 1): -    ok = False -    for j in a: -        if i - j < 0: -            continue -        if ans[i - j] == False: -            ans[i] = True -            break -print(("First" if ans[k] else "Second")) +dp = [0] * (k + 1 + 1234) +for i in range(0, k + 1): +    if dp[i] == 0: +        for x in a: +            dp[min(i + x, k + 1)] = 1 +print(("First" if dp[k] else "Second"))