#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, pile;
  cin >> n >> pile;
  long long set[n], c = INT_MAX;
  for (long long i = 0; i < n; i++) {
    cin >> set[i];
    if (set[i] < c) c = set[i];
  }
  long long p = 1;
  bool ok = false;
  while (1) {
    if (p % 2 != 0) {
      for (long long g = 0; g < n; g++) {
        if (pile - set[g] < c) {
          cout << "First";
          ok = true;
          break;
        }
      }
      pile -= c;
    } else {
      for (long long u = 0; u < n; u++) {
        if (pile - set[u] < c) {
          cout << "Second";
          ok = true;
          break;
        }
      }
      pile -= c;
    }
    if (ok) break;
    p++;
  }
  return 0;
}
