#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int dp[101][MAXN], a[101], n;
int solve(int on, int k) {
  cout << on << ' ' << k << '\n';
  int &ans = dp[on][k];
  if (~ans) return ans;
  ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > k) continue;
    ans = ans | (!solve(!on, k - a[i]));
    if (ans) break;
  }
  return ans;
}
int main() {
  memset(dp, -1, sizeof(dp));
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (solve(0, k)) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
