import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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



dp[0][0] = 1
dp[0][1] = 0

for kLeft in range(1, k+1):
    for player in range(2):
        done = False
        for i in range(n):
            x = 1-player
            if (kLeft-a[i]>=0):
                x = dp[kLeft-a[i]][1-player]
            if (x==player):
                dp[kLeft][player] = player
                done=True
                break
        if done==False:
            dp[kLeft][player] = 1-player

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)
# z = dp[k][0]

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