#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 107, MAXK = 1e1 + 7;
int n, k;
int lst[MAXN], dp[MAXK]{-1};
int winner(int rem) {
  if (dp[rem]) return dp[rem];
  bool canwin = false;
  for (int i = 0; i != n; ++i)
    if (lst[i] <= rem && winner(rem - lst[i]) == -1) {
      canwin = true;
      break;
    }
  return dp[rem] = (canwin ? 1 : -1);
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i != n; ++i) scanf("%d", &lst[i]);
  puts(winner(k) == 1 ? "First" : "Second");
}
