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: #include<bits/stdc++.h> 
  using namespace std; 
  #define M int(1e9+7)
  #define ll long long
  #define lli long long int
  #define I 10e5
  
  int32_t main() 
  { 
     ios_base::sync_with_stdio(false);cin.tie(NULL); 
     
     #ifndef ONLINE_JUDGE 
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout); 
     #endif
     int n, k;
     cin>>n>>k;
     vector<int> v(n);
     for(auto &i:v)
     {
        cin>>i;
     }
     int dp[k+1];
     memset(dp, 0, sizeof(dp));
     for(int i=1;i<=k;i++)
     {
        for(int j=0;j<n;j++)
        {
           if(v[j]>i)
              continue;
           if(dp[i-v[j]]==0)
              dp[i] = 1;
        }
     }
     cout<<(dp[k]==0?"Second":"First");
     cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl; 
     return 0; 
  }
  
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"}]