#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, OO = 0x3F3F3F3F;
int n, k, dp[105][N][3];
vector<int> a;
bool solve(int idx, int rem, bool p) {
  if (rem < 0) return p;
  if (rem == 0) return !p;
  if (idx == n) return p;
  int& ret = dp[idx][rem][p];
  if (~ret) return ret;
  if (solve(idx + 1, rem - a[idx], !p) == p) return ret = p;
  return ret = !p;
}
int main() {
  scanf("%d %d", &n, &k);
  a.resize(n);
  for (int& x : a) scanf("%d", &x);
  memset(dp, -1, sizeof dp);
  bool ans = solve(0, k, 0);
  puts(ans ? "Second" : "First");
  return 0;
}
