#include <bits/stdc++.h>
using namespace std;
int dp[100005], a[102];
int n;
int solve(int k) {
  if (dp[k] != -1) return dp[k];
  if (k == 0) return dp[k] = 0;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (dp[i] > k) continue;
    if (solve(k - a[i]) == 0) {
      ans = 1;
      break;
    }
  }
  cout << "dp[" << k << "]=" << ans << "   ";
  dp[k] = ans;
  return ans;
}
int main() {
  int k;
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; i++) cin >> a[i];
  if (solve(k))
    cout << "first";
  else
    cout << "Second";
}
