#include <bits/stdc++.h>
using namespace std;
long long a[190], n, k, dp[100090][120];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      int bla = i - a[j];
      if (bla >= 0) {
        dp[i][j] = (!dp[bla][j]);
      }
      if (j > 0) dp[i][j] |= dp[i][j - 1];
    }
  }
  int ans = 0;
  for (int j = 0; j < n; j++) ans |= dp[k][j];
  cout << ((ans > 0) ? "First" : "Second");
  return 0;
}
