#include <bits/stdc++.h>
using namespace std;
bool dp[101][100001];
int winner(int n, int k, int stones[]) {
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      if (i == 0) {
        dp[i][j] = false;
      } else if (j == 0) {
        dp[i][j] = true;
      } else if (stones[i] <= j) {
        dp[i][j] = !dp[i - 1][j - stones[i]] || dp[i][j];
      }
    }
  }
  return dp[n][k];
}
int main() {
  int n, k;
  cin >> n >> k;
  int stones[n];
  for (int i = 0; i < n; i++) {
    cin >> stones[i];
  }
  memset(dp, false, sizeof dp);
  int ans = winner(n, k, stones);
  if (ans) {
    cout << "FIRST";
  } else {
    cout << "SECOND";
  }
}
