#include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
  int n, k, low = INT_MAX;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] < low) low = a[i];
  }
  sort(a, a + n, greater<int>());
  int turn = 1;
  while (low > k) {
    int num = 0;
    for (int i = 0; i < n; i++) {
      int p = k - a[i];
      if (p == 0 || p < low) {
        if (turn == 1) {
          cout << "First" << endl;
        } else
          cout << "Second" << endl;
        return 0;
      }
      num++;
      int f = 0;
      for (int j = 0; j < n; j++) {
        if (p - a[i] == 0 || p - a[i] < low) {
          f = 1;
          break;
        }
      }
      if (f == 0) {
        k -= a[i];
        if (turn == 1)
          turn = 2;
        else
          turn = 1;
        i = -1;
      }
    }
    if (num == n && k > 0) {
      if (turn == 2) {
        cout << "First" << endl;
      } else
        cout << "Second" << endl;
      return 0;
    }
  }
  if (turn == 1) {
    cout << "First" << endl;
  } else
    cout << "Second" << endl;
  return 0;
}
