#include <bits/stdc++.h>
using namespace std;
const long long mxN = 1e5 + 5;
const long long base = 311;
const long long oo = 1e15;
const long long MOD = 1e9 + 7;
const long long d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const long long d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
                d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
long long TestCase;
long long n, k;
long long a[mxN];
bool dp[mxN];
void Solve() {
  cin >> n >> k;
  for (long long i = (long long)1; i <= (long long)n; i++) cin >> a[i];
  for (long long i = (long long)1; i <= (long long)k; i++) {
    for (long long j = (long long)1; j <= (long long)n; j++) {
      if (a[j] > i) continue;
      if (!dp[i - a[j]]) dp[i] = true;
    }
  }
  if (dp[k])
    cout << "FIRST";
  else
    cout << "SECOND";
}
int main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  TestCase = 1;
  while (TestCase--) Solve();
  return 0;
}
