#include <bits/stdc++.h>
using namespace std;
long long n, k, x, i, j, dp[200005];
set<long long> s;
vector<long long> v;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cerr.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (i = 1; i <= n; i++) {
    cin >> x;
    v.push_back(x);
  }
  for (i = 1; i <= k; i++) {
    for (auto x : v) {
      if (i >= x && !dp[i - x]) {
        dp[i] = true;
      }
    }
  }
  if (dp[k])
    cout << "FIRST";
  else
    cout << "SECOND";
  return 0;
}
