from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 6)

@lru_cache(maxsize=None)
def dp(k, A, turn):
    for i in A:
        if i > k:
            break
        if dp(k - i, A, not turn) == turn:
            return turn
    return not turn
    

def main():
    N, K = map(int, input().split())
    A = tuple(sorted(map(int, input().split())))
    print('First' if dp(K, A, True) else 'Second')


main()
