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