#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 30;
typedef struct {
  long long x, y;
} point;
priority_queue<pair<double, double>, vector<pair<double, double> >,
               greater<pair<double, double> > >
    pq;
vector<pair<double, pair<double, double> > > vpp;
vector<pair<double, double> > vp;
int n, k;
int arr[100005];
int dp[1000005];
int rec(int x) {
  if (dp[x] != -1) return dp[x];
  int check = 0;
  for (int i = 0; i < n; i++) {
    if (x + arr[i] <= k) {
      if (rec(x + arr[i]) == 0) check = 1;
    }
  }
  return dp[x] = check;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i <= n; i++) dp[i] = -1;
  if (rec(0) == 1) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
