import resource
import sys
from functools import lru_cache
N, K = map(int, input().split())
A = list(map(int, input().split()))

sys.setrecursionlimit(1000000)

@lru_cache(maxsize=None)
def f(k, p):
  w = set()
  for a in A:
    if k >= a:
      w.add(f(k-a, p ^ 1))
  if len(w) == 0:
    return p ^ 1
  elif None in w:
    return None
  elif p in w:
    return p
  else:
    return 1 ^ p


print('First' if f(K, 0) == 0 else 'Second')
