#pragma GCC optimize("Ofast","unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace::std;
//struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
__attribute__((constructor))
void init(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(15);
}
// random_device rd;
// mt19937 mt(rd());
// #include <boost/numeric/interval.hpp>
// #include <boost/numeric/interval/io.hpp>
// #include <boost/intrusive/rbtree.hpp>
// #include <boost/dynamic_bitset.hpp>
// #include <boost/geometry.hpp>
// #include <boost/geometry/geometries/linestring.hpp>
// #include <boost/geometry/geometries/polygon.hpp>
// #include <boost/geometry/geometries/point_xy.hpp>
// #include <boost/math/tools/minima.hpp>
// using boost::math::tools::brent_find_minima;
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<256>> cdouble;
// typedef mp::cpp_int cint;
// #include <boost/unordered_map.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
template<typename T=long long>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
template<typename T>using Vec=vector<T>;
template<typename T>using Mat=vector<vector<T>>;
template<typename T>using Mat3=vector<vector<vector<T>>>;
template<typename T>using Mat4=vector<vector<vector<vector<T>>>>;
template<typename S,typename T>using pvec=vector<pair<S,T>>;
template<typename S,typename T>using pmat=vector<vector<pair<S,T>>>;
template<typename S,typename T>using pmat3=vector<vector<vector<pair<S,T>>>>;
template<typename S,typename T>using pmat4=vector<vector<vector<vector<pair<S,T>>>>>;
template<typename... T>using tvec=vector<tuple<T...>>;
template<typename... T>using tmat=vector<vector<tuple<T...>>>;
template<typename... T>using tmat3=vector<vector<vector<tuple<T...>>>>;
template<typename... T>using tmat4=vector<vector<vector<vector<tuple<T...>>>>>;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
//#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define LINF 9223372036854775807
//#define MOD 998244353LL
#define MOD 1000000007LL
#define endl "\n"
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(int i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(int i=0;i<t.size();i++)output(t[i]);}
auto Y=[&](auto f){return[&](auto... args){return f(f, args...);};};
template<typename T=lint>T in(){return *istream_iterator<T>(cin);}
template<typename T=lint>inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline T minq(T a,T b){return min(a,b);}
template<typename T>inline T maxq(T a,T b){return max(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={-1,1,0,0,1,1,-1,-1};
const vector<lint> dy={0,0,-1,1,1,-1,1,-1};


class dinamic_connectivity{
    using DC=dinamic_connectivity*;
    class euler_tour_tree{
        unsigned long rnd() {
            static unsigned long x=123456789, y=362436069, z=521288629, w=88675123;
            unsigned long t=(x^(x<<11));
            x=y; y=z; z=w;
            return ( w=(w^(w>>19))^(t^(t>>8)) );
        }
        struct node;
        using np=shared_ptr<node>;
        struct node{
            np par=nullptr;
            np ch[2]={nullptr,nullptr};
            int l,r,cnt=1;
            node(int l,int r):l(l),r(r){}
        };
        inline int count(np t){return !t?0:t->cnt;}
        np update(const np t){
            if(!t)return t;
            t->cnt=count(t->ch[0])+count(t->ch[1])+1;
            return t;
        }
        int sz;
        unordered_map<int,unordered_map<int,np>> ptr;
        public:
        euler_tour_tree(){}
        np get_node(const int& l,const int& r){
            if(!ptr[l].count(r))ptr[l][r]=make_shared<node>(l,r);
            return ptr[l][r];
        }
        inline bool same(const int& s,const int& t){
            return root(get_node(s,s))==root(get_node(t,t));
        }
        bool link(const int& l,const int r){
            if(same(l,r))return 0;
            merge(reroot(get_node(l,l)),get_node(l,r),reroot(get_node(r,r)),get_node(r,l));
            return 1;
        }
        bool f=0;
        bool cut(const int& l,const int& r){
			if(!ptr[l].count(r))return 0;
            split_and_merge(get_node(l,r),get_node(r,l));
            ptr[r].erase(l);
			ptr[l].erase(r);
            return 1;
        }
        inline int size(const int& t){
            return root(get_node(t,t))->cnt;
        }
        void upgrade_edge(const int& s,euler_tour_tree& next){
            stack<np> stk;
            stk.emplace(root(get_node(s,s)));
            while(!stk.empty()){
                auto t=stk.top();
                stk.pop();
                if(!t)continue;
                if(t->l<t->r){
                    next.link(t->l,t->r);
                }
                stk.emplace(t->ch[0]);
                stk.emplace(t->ch[1]);
            };
        }
        pair<int,int> try_reconnect(const int& s,const int& t,const int& layer,DC dc){
            stack<np> stk;
            unordered_set<int>tmp;
            stk.emplace(root(get_node(s,s)));
            while(!stk.empty()){
                const auto s=stk.top();
                stk.pop();
                if(!s)continue;
                if(!tmp.count(s->l)){
                    auto d=dc->reconnect(s->l,t,layer);
                    if(d.first!=-1)return d;
                }else tmp.emplace(s->l);
                stk.emplace(s->ch[0]);
                stk.emplace(s->ch[1]);
            }
            return {-1,-1};
        }
        private:
        inline np reroot(const np t){
            auto s=split(t);
            auto u=merge(s.second,s.first);
            return u;
        }
        inline np root(np t){
            while(t->par){
                t=t->par;
            }
            return t;
        }
        inline void merge(const np p,const np q,const np r,const np s){
            merge(p,q);
            merge(r,s);
            merge(p,r);
        }
        np merge(np s,np t){
            if(!s)return t;
            if(!t)return s;
            s=root(s);
            t=root(t);
            while(s->ch[1])s=s->ch[1];
            expose(s);
            set_child(s,t,1);
            return s;
        }
        pair<np,np> split(const np t){
            expose(t);
            const auto s=t->ch[0];
            set_child(t,nullptr,0);
            return {s,t};
        }
        void split_and_merge(const np s,const np t){
            assert(s);
            assert(t);
            expose(s);
            expose(t);
            if(t->ch[0]!=s&&t->ch[1]!=s)rot(s);
            if(t->ch[0]==s){
                const np p=s->ch[0];
                const np q=s->ch[1];
                const np r=t->ch[1];
                set_child(s,nullptr,0);
                set_child(s,nullptr,1);
                set_child(t,nullptr,0);
                set_child(t,nullptr,1);
                merge(p,r);
            }else{
                const np p=t->ch[0];
                const np q=s->ch[0];
                const np r=s->ch[1];
                set_child(s,nullptr,0);
                set_child(s,nullptr,1);
                set_child(t,nullptr,0);
                set_child(t,nullptr,1);
                merge(p,r);
            }
        }
        void debug(const np t){
            if(!t)return;
            debug(t->ch[0]);
            cout<<t->l<<" ";
            debug(t->ch[1]);
        }
        np expose(const np t){
            if(!t)return t;
            while(t->par){
                if(t->par->par){
                    if((t->par&&t->par->par)&&((t->par->par->ch[0]&&t->par->par->ch[0]->ch[0])||(t->par->par->ch[1]&&t->par->par->ch[1]->ch[1]))){
                        rot(t->par);rot(t);
                    }else{
                        rot(t);rot(t);
                    }
                }else{
                    rot(t);
                }
            }
            return t;
        }
        void rot(const np t){
            assert(t);
            const np s=t->par;
            if(!s)return;
            const np u=s->par;
            const bool b=t==s->ch[1];
            const bool b2=u?s==u->ch[1]:0;
            set_child(s,t->ch[1-b],b);
            set_child(t,s,1-b);
            if(u)set_child(u,t,b2);
            else t->par=nullptr;
        }
        inline void set_child(const np p,const np ch,const bool& b){
            assert(p);
            if(p->ch[b])p->ch[b]->par=nullptr;
            if(ch&&ch->par){
                ch->par->ch[ch->par->ch[1]==ch]=nullptr;
                update(ch->par);
            }
            p->ch[b]=ch;
            if(ch)ch->par=p;
            update(ch);
            update(p);
        }
    };
    unordered_map<int,euler_tour_tree> ett;
    unordered_map<int,unordered_map<int,int>> edge;
    unordered_map<int,unordered_map<int,unordered_map<int,bool>>> edgeList;
    int sz,log=0;
    public:
    dinamic_connectivity(const int& sz):sz(sz){}
    inline bool link(const int& s,const int& t){
        edge[s][t]++;
        edge[t][s]++;
        edgeList[0][s][t]=1;
		edgeList[0][t][s]=1;
        return ett[0].link(s,t);
    }
    inline bool same(const int& s,const int& t){
        return ett[0].same(s,t);
    }
    inline bool cut(int s,int t){
        if(edge[s][t]>0){
            edge[s][t]--;
            edge[t][s]--;
        }
        if(edge[s][t])return 0;
        for(int i=0;i<=log;i++){
            edgeList[i][s].erase(t);
            edgeList[i][t].erase(s);
        }
        pair<int,int>d=make_pair(-1,-1);
        for(int i=log;i>=0;i--){
            if(ett[i].cut(s,t)){
                if(d.first!=-1)continue;
                if(log<i+1)log=i+1;
				if(ett[i].size(s)>ett[i].size(t))swap(s,t);
                ett[i].upgrade_edge(s,ett[i+1]);
                d=ett[i].try_reconnect(s,t,i,this);
            }
        }
        if(d.first!=-1){
            ett[0].link(d.first,d.second);
            return 0;
        }
		return 1;
    }
 
    pair<int,int> reconnect(const int& s,const int& t,const int& layer){
		pair<int,int> res={-1,-1};
        for(auto d:edgeList[layer][s]){
            int es=s,et=d.first;
            if(res.first==-1&&ett[layer].same(et,t)){
                res={es,et};
            }else if(ett[layer].same(et,s)){
                edgeList[layer+1][es][et]=1;
                edgeList[layer+1][et][es]=1;
            }
        }
		return res;
    }
};

int main(){
    lint n,k;
    cin>>n>>k;
    vec a(n);
    rep(i,n)cin>>a[i];
    vector<set<lint>>dp(k+1);
    rep(i,k+1){
        lint mex=0;
        while(dp[i].count(mex))mex++;
        for(lint d:a){
            if(i+d<=k)dp[i+d].emplace(mex);
        }
        if(i==k){
            if(mex)cout<<"First"<<endl;
            else cout<<"Second"<<endl;
        }
    }
}