#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[101];
int dp[100000 + 1][3];
int rec(int stones, int person) {
  if (stones < a[1]) return (person % 2) + 1;
  if (dp[stones][person] != -1) return dp[stones][person];
  for (int i = (int)1; i <= (int)n; i++) {
    if (stones >= a[i]) {
      if (rec(stones - a[i], (person % 2) + 1) == person) return person;
    }
  }
  return dp[stones][person] = (person % 2) + 1;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  for (int i = (int)1; i <= (int)n; i++) cin >> a[i];
  if (rec(k, 1) == 1)
    cout << "First";
  else
    cout << "Second";
}
