#include<bits/stdc++.h>

#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
using namespace std;
struct Grid{int x,y,t;};
struct Edge{int to,cost;};
struct Graph{vector<vector<Edge>>E;int V;
  const ll Inf = llINF;const int MAX_V=1010;vector<ll>d;
  Graph(int n):E(n){d.resize(MAX_V);E.resize(n);V=n;}
  void init(){for(int i=0;i<MAX_V;i++)d[i]=Inf;}
  void add_edge(int from,int to,int cost){E[from-1].pb({to-1,cost});}
};
int main(){
  int n,k;cin>>n>>k;
  vector<int>stone(n);
  for(int i=0;i<n;i++)cin>>stone[i];
  int dp[2*k+10]={};
  dp[0]=0;
  for(int i=0;i<k;i++){
    for(int j=0;j<n;j++)
      dp[i+stone[j]]=(dp[i]+1)%2;
  }
  if(dp[k]%2)
    cout<<"First"<<endl;
  else
    cout<<"Second"<<endl;
  return 0;
}
