N, K = map(int, input().split())
# 復元プール
a = list(map(int, input().split()))
dp = [False for _ in range(K+1)]
# dp[i]石が残りi個のとき、先手が勝てるか
for i in range(1, K+1):
    for j in range(N):
        if i - a[j] >= 0:
            dp[i] = dp[i] or (not dp[i - a[j]])
if dp[K]:
    print("First")
else:
    print("Second")