def solve(N, K, cards):
  min_elem = cards[0]

  TARO, JIRO = 0, 1
  dp = [[-1 for _ in range(K + 1)] for _ in range(2)]

  dp[TARO][0] = TARO
  dp[JIRO][0] = JIRO

  for i in range(min_elem):
    dp[JIRO][i] = TARO
    dp[TARO][i] = JIRO

  for k in range(1, K + 1):
    for turn in [TARO, JIRO]:
      opp = JIRO if turn == TARO else TARO
      dp[turn][k] = opp
      for c in cards:
        if c > k:
          break
        if k - c == 0:
          dp[turn][k] = turn
          break
        if k - c > 0 and dp[opp][k - c] == turn:
          dp[turn][k] = turn

  print("First" if dp[TARO][K] == TARO else "Second")

  
def iln(): return list(map(int, input().split()))


N, K = iln()
cards = iln()
solve(N, K, cards)