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

dp = [[-1]*2 for i in range(k+1)]

def solve(kLeft, player):
    if (kLeft<0):
        return player

    if (kLeft==0):
        return 1-player

    if (dp[kLeft][player]!=-1):
        return dp[kLeft][player]

    for i in range(n):
        x = solve(kLeft-a[i], 1-player)
        if (x==player):
            dp[kLeft][player] = player
            return dp[kLeft][player]
    dp[kLeft][player] = 1-player
    return dp[kLeft][player]


z = solve(k, 0)

if (z==0):
    print("First")
else:
    print("Second")