# @author 

import sys

class KStones:
    def solve(self):
        n, k = [int(_) for _ in input().split()]
        a = [int(_) for _ in input().split()]
        dp = [0] * (k + 1) # can we win with i remaining ?
        for i in range(min(a), k + 1):
            dp[i] = int(any(not dp[i - x] for x in a))
        
        print("First" if dp[k] else "Second")

solver = KStones()
input = sys.stdin.readline

solver.solve()
