import sys
sys.setrecursionlimit(10 ** 6)


def main():
    N, K = map(int, input().split())
    A = tuple(sorted(map(int, input().split())))
    c = [0] * (K + 1)
    def dp(k, A, c, turn):
        if c[k] != 0:
            return c[k] * turn
        t = -turn
        for i in A:
            if i > k:
                break
            if dp(k - i, A, c, -turn) == turn:
                t = turn
                break
        c[k] = t
        return t
    
    print('First' if dp(K, A, c, 1) else 'Second')


main()
