#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
 
 
void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
}
 
 int dp[100005];
 
 vi arr(105,0);
 set<int> ss;
 int n,k;
 int cmp;
 int calmex(set<int> &s)
 {
     int t=0;
     while(s.find(t)!=s.end())
     {
         t++;
     }
     return t;
 }
 int calculategrundy(int num)
 {   
     if(num<0)
     return 0;
     if(num<cmp)
     dp[num]=0;
     if(num==0)
     return dp[num]=0;
     if(dp[num]!=-1)
     return dp[num];
     set<int> s;
     for(int i=1;i<=n;i++)
     {
         
         s.insert(calculategrundy(num-arr[i]));
     }
    return dp[num]=calmex(s);
 }
int32_t main()
{
    c_p_c();
    //  cout<<"gg";
    cin>>n>>k;
  
  memset(dp,-1,sizeof(dp));
  for(int i=1;i<=n;i++)
  {
      cin>>arr[i];
      ss.insert(arr[i]);
  }
  cmp=*ss.begin();
  //cout<<cmp;
  //cout<<"gg";
  int x=calculategrundy(k);
  //cout<<"gg";
  int ans=0;
  for(int i=1;i<=n;i++)
  {
      ans=ans^dp[k-arr[i]];
  }
  
  if(ans)
  {
      cout<<"First";
  }
  else
  cout<<"Second";
    
    return 0;
}