#include <bits/stdc++.h>
using namespace std;
int dp[100001][2], a[101], n;
int recur(int k, bool p) {
  if (k < a[0]) return not p;
  int &ret = dp[k][p];
  for (int i = 0; i < n and k - a[i] >= 0; ++i)
    if (recur(k - a[i], not p) == p) return ret = p;
  return ret = not p;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  memset(dp, -1, sizeof dp);
  cout << (recur(k, 0) == 0 ? "First" : "Second") << endl;
  return 0;
}
