#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, a[101];
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  bool dp[k + 1];
  for (int i = 0; i < a[0]; i++) dp[i] = 0;
  for (int i = a[0]; i <= k; i++) {
    if (a[n - 1] >= i) {
      dp[i] = 1;
    } else {
      int res = 0;
      for (int j = 0; j < n; j++) {
        res = (res + dp[i - a[j]]);
      }
      if (res != n)
        dp[i] = 1;
      else
        dp[i] = 0;
    }
  }
  if (dp[k]) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
