#include <bits/stdc++.h>
using namespace std;
const int N(109);
int n, m, k, ans;
int a[N];
int f[N][2];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < 2; j++) {
      for (int l = 1; l <= n; l++) {
        if (i >= a[l] && !f[i - a[l]][!j]) {
          f[i][j] = 1;
        }
      }
    }
  }
  if (f[k][0])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
