output_description: If Taro will win, print `First`; if Jiro will win, print `Second`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      a_1 a_2 \ldots a_N
attempt: import sys
  
  stdin = sys.stdin
  
  sys.setrecursionlimit(10**5)
  
  
  def li():
      return map(int, stdin.readline().split())
  
  
  def li_():
      return map(lambda x: int(x) - 1, stdin.readline().split())
  
  
  def lf():
      return map(float, stdin.readline().split())
  
  
  def ls():
      return stdin.readline().split()
  
  
  def ns():
      return stdin.readline().rstrip()
  
  
  def lc():
      return list(ns())
  
  
  def ni():
      return int(stdin.readline())
  
  
  def nf():
      return float(stdin.readline())
  
  
  n, k = li()
  a = list(li())
  dp = [-1] * (k + 1)
  dp[0] = 0
  
  for m in range(1, k + 1):
      for ai in a:
          if m - ai >= 0:
              if dp[m - ai] == 0:
                  dp[m] = 1
                  break
  
          dp[m] = 0
  
  print("First") if dp[k] == 1 else print("Second")
  
problem_description: Statement
  
  There is a set A = \\{ a_1, a_2, \ldots, a_N \\} consisting of N positive
  integers. Taro and Jiro will play the following game against each other.
  
  Initially, we have a pile consisting of K stones. The two players perform the
  following operation alternately, starting from Taro:
  
    * Choose an element x in A, and remove exactly x stones from the pile.
  
  A player loses when he becomes unable to play. Assuming that both players play
  optimally, determine the winner.
samples: [{"input": "2 4\n    2 3", "output": "First\n    \n\nIf Taro removes three stones, Jiro cannot make a move. Thus, Taro wins.\n\n* * *"}, {"input": "2 5\n    2 3", "output": "Second\n    \n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\n  * If Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n  * If Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\n* * *"}, {"input": "2 7\n    2 3", "output": "First\n    \n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro\nwins, as follows:\n\n  * If Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n  * If Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\n* * *"}, {"input": "3 20\n    1 2 3", "output": "Second\n    \n\n* * *"}, {"input": "3 21\n    1 2 3", "output": "First\n    \n\n* * *"}, {"input": "1 100000\n    1", "output": "Second"}]