#include <bits/stdc++.h>
using namespace std;
const int MaxN = 112345;
const long long mod = 1000000007;
class Solver {
  int n, kk, *a;
  int dp[MaxN];

 public:
  Solver() { solve(); }
  void solve();
  int solve(int k) {
    cout << k << "k " << endl;
    if (k == 0) return false;
    if (dp[k] != -1) return dp[k];
    int win = 0;
    for (int i = 0; i < n; i++) {
      if (k < a[i]) continue;
      win |= (!solve(k - a[i]));
    }
    return dp[k] = win;
  }
};
void Solver::solve() {
  cin >> n >> kk;
  a = new int[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  memset(dp, -1, sizeof(dp));
  int ans = solve(kk);
  if (ans)
    cout << "First\n";
  else
    cout << "Second\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    Solver s;
  }
}
