#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline int Chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline int Chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
template <typename T>
T read() {
  T sum = 0, fl = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fl = -1;
  for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
  return sum * fl;
}
const int Maxn = 100 + 10, Maxm = 1e5 + 10;
int N, M, A[Maxn], Dp[Maxm];
inline void Solve() {
  memset(Dp, -1, sizeof Dp);
  for (int i = 0; i < A[1]; ++i) Dp[i] = 0;
  for (int i = 1; i <= N; ++i)
    for (int j = 0; j <= M - A[i]; ++j) {
      if (!Dp[j]) {
        Dp[j + A[i]] = 1;
      } else if (Dp[j]) {
        if (Dp[j + A[i]] != 1) Dp[j + A[i]] = 0;
      }
    }
  if (Dp[M])
    printf("First");
  else
    printf("Second");
}
inline void Input() {
  N = read<int>(), M = read<int>();
  for (int i = 1; i <= N; ++i) A[i] = read<int>();
}
int main() {
  Input();
  Solve();
  return 0;
}
