#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, i, move;
  cin >> n >> k;
  int a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  i = n - 1;
  move = 0;
  while (k > 0) {
    k -= a[i];
    i--;
    move = (move + 1) % 2;
  }
  if ((move + 1) % 2 == 0)
    cout << "Second\n";
  else
    cout << "First\n";
  return 0;
}
