#include <bits/stdc++.h>
using namespace std;
const int cap = 1e5 + 1;
int A[101];
bool dp[cap];
int N, K;
int main() {
  scanf("%d %d", &N, &K);
  for (int i = 1; i <= N; ++i) scanf(" %d", &A[i]);
  int min_a = *min_element(A + 1, A + N + 1);
  fill(dp, dp + K + 1, false);
  for (int i = 0; i + min_a <= K; ++i) {
    if (!dp[i])
      for (int j = 1; j <= N; ++j) dp[i + A[j]] = true;
  }
  string ans = dp[K] ? "First" : "Second";
  cout << ans << endl;
}
