#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100001;
vector<int> red;
int top = -MAXN;
int bot = MAXN;
int n, k;
int main() {
  cin >> n >> k;
  int upis;
  for (int i = 0; i < n; i++) {
    cin >> upis;
    red.push_back(upis);
  }
  bot = 0;
  top = n - 1;
  bool Taro = true;
  while (k > 0) {
    if (k - red[top] < red[bot]) {
      k = 0;
    } else {
      if (k - red[bot] == red[top]) {
        int j = top - 1;
        for (int i = bot + 1; i < top; i++) {
          if (k - red[i] > red[j]) {
            bot = i;
            top = j;
            break;
          }
          j--;
        }
      }
      k -= red[bot];
      if (Taro)
        Taro = false;
      else
        Taro = true;
    }
  }
  if (Taro)
    cout << "First";
  else
    cout << "Second";
}
