#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const long long INF = 1e13;
int n, k;
int solve(int val, vector<int>& dp, vector<int>& arr) {
  if (dp[val] != -1) return dp[val];
  int flag = 1;
  for (int i = 0; i < n; i++) {
    if (arr[i] <= val) {
      flag = 0;
      break;
    }
  }
  if (flag) return 0;
  for (int i = 0; i < n; i++) {
    if (arr[i] <= val) {
      if (solve(val - arr[i], dp, arr) == 0) {
        dp[val] = 1;
        return dp[val];
      }
    }
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  vector<int> dp(k + 1, -1);
  dp[0] = 0;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  if (solve(k, dp, arr))
    cout << "FIRST" << endl;
  else
    cout << "SECOND" << endl;
  return 0;
}
