#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[105];
int loser = -1;
int dp[2][(int)1e5 + 5];
bool solve(int turn, int cnt) {
  if (cnt < a[0]) {
    if (turn == 1) return true;
    return false;
  }
  if (dp[turn][cnt] != -1) return dp[turn][cnt];
  bool res = false;
  bool res1 = true;
  for (int i = 0; i < n; i++) {
    if (turn == 0) {
      res |= solve(turn ^ 1, cnt - a[i]);
    } else {
      res1 &= solve(turn ^ 1, cnt - a[i]);
    }
  }
  if (turn == 0)
    return dp[turn][cnt] = res;
  else
    return dp[turn][cnt] = res1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  for (int i = 0; i < 1e5 + 5; i++) dp[0][i] = dp[1][i] = -1;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  cout << (solve(0, k) ? "First" : "Second") << endl;
  return 0;
}
