#include <bits/stdc++.h>
using namespace std;
int a[101];
int n, k;
int f[100005];
int main() {
  memset(f, -1, sizeof(f));
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i <= k; i++)
    for (int j = 0; j < n; j++) {
      if (i >= a[j]) f[i] = max(f[i], 1 - f[i - a[j]]);
    }
  if (f[k] == 1)
    cout << "First";
  else
    cout << "Second";
}
