#include <bits/stdc++.h>
using namespace std;
const int maxK = 1e5 + 5;
vector<int> w(maxK, 0), l(maxK, 1), st(305);
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> st[i];
  for (int i = 0; i < n; i++) {
    w[st[i]] = 1, l[st[i]] = 0;
  }
  for (int i = st[0] + 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - st[j] >= st[0]) {
        w[i] |= l[i - st[j]];
        l[i] &= w[i - st[j]];
      } else if (i - st[j] >= 0) {
        w[i] |= w[st[j]];
        l[i] &= l[st[j]];
      }
    }
  }
  cout << (w[k] ? "FIRST" : "SECOND");
  return 0;
}
