#include<bits/stdc++.h>
using namespace std; 
 
long long int n,k,a[1000], dp[1000009];
// dp[k][turn];
 
int main(){
  
  cin>>n>>k;
  for(int i = 1; i<=n;i++)
    cin>>a[i];

  if(k == 0)
  dp[k] = 2;


  for(int i = 1; i<=k; i++){
    for(int j = 1; j<=n; j++){
      if(i-a[j]>=0){
          // dependencies of dynamic relation 
         // dp[i]|=!(dp[i-a[j]]);
         if(dp[i-a[j]] == 1){
          dp[i] = 2;
         else 
           dp[i] = 1;
         }
         
      }
    }
  }
  
  if(dp[k]== 1) cout<<"First"<<endl;
  else 
    cout<<"Second"<<endl;
 
  return 0;
}
