#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main(void) {
  int N;
  cin >> N;
  long long K;
  cin >> K;
  int A[N];
  for (int i = 0; i < N; i++) cin >> A[i];
  bool dp[K + 1];
  for (int i = A[0]; i <= K; i++) {
    bool res = false;
    for (int j = 0; j < N; j++) {
      int val = i - A[j];
      if (val < 0) break;
      if (!dp[val]) res = true;
    }
    dp[i] = res;
  }
  if (dp[K])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
