#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x)   scanf("%d",&x)
#define sl(x)   scanf("%lld",&x)
#define ss(s)   scanf("%s",s)
#define pi(x)   printf("%d\n",x)
#define pl(x)   printf("%lld\n",x)
#define ps(s)   printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int>  pii;
typedef pair<ll, ll>    pl;
typedef vector<int>     vi;
typedef vector<ll>      vl;
typedef vector<pii>     vpii;
typedef vector<pl>      vpl;
typedef vector<vi>      vvi;
typedef vector<vl>      vvl;
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
//=======================
string getString(char t){
  string s(1, t);
  return s;
}
bool solve(string s, int i, int j, set<string> list){
        int len = j-i+1;
        string temp = s.substr(i, len);
       // cout<<temp;
        if(list.find(temp)!=list.end()){
            return true;
        }
        if(i==j)
            return false;

        bool ans = false;
        for(int k=  i; k<j; k++){
            bool temp1 = solve(s, i, k, list);
            bool temp2 = solve(s, k+1, j, list);
            if(temp1==true && temp2==true)
                ans = true;
        }
        return ans;


    }
    bool wordBreak(string s, vector<string>& wordDict) {

        set<string> list;
        int n = s.size();
        for(int i=0; i<wordDict.size(); i++){
            list.insert(wordDict[i]);
        }

        bool result = solve(s, 0, n-1, list);
        return result;

    }
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());

    int t = 1;
    //cin >> t;
    while(t--) {
      int n; cin>>n; int k; cin>>k;
      int a[n];
      for(int i=0; i<n; i++)
        cin>>a[i];
      int dp[k+1];

      for(int i=0; i<k+1; i++){
        dp[i] = 2;
      }

      for(int i=0; i<n; i++){
        dp[a[i]] = 1;
      }

      for(int i=1; i<k+1; i++){
        if(dp[i]==2){
          for(int j=0; j<n; j++){
            int temp = i - a[j];
            if(temp>=1){
              if(dp[temp]==2)
                dp[i] = 1;
            }
          }
        }
      }
      if(dp[k]==1)
        cout<<"First\n";
      else
        cout<<"Second\n";

    }
    return 0;
}

// int mpow(int base, int exp) {
//   base %= mod;
//   int result = 1;
//   while (exp > 0) {
//     if (exp & 1) result = ((ll)result * base) % mod;
//     base = ((ll)base * base) % mod;
//     exp >>= 1;
//   }
//   return result;
// }

// void ipgraph(int n, int m){
//     int i, u, v;
//     while(m--){
//         cin>>u>>v;
//     u--, v--;
//         g[u].pb(v);
//         g[v].pb(u);
//     }
// }

// void dfs(int u, int par){
//     for(int v:g[u]){
//         if (v == par) continue;
//         dfs(v, u);
//     }
// }


Measured memory_bytes: 3960