#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5, mod = 1e9 + 7;
int n, c[maxn], a[maxn], m;
bool f[maxn];
bool dp(int stone) {
  if (stone == 0) return true;
  if (!c[stone]) {
    c[stone] = true;
    for (int i = 1; i <= n; ++i)
      if (stone >= a[i]) f[stone] |= (!dp(stone - a[i]));
  }
  return f[stone];
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  if (!dp(m))
    cout << "First";
  else
    cout << "Second";
}
