#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int n;
int a[105];
int cal(int k) {
  if (dp[k] != -1) return dp[k];
  for (int i = 0; i < n; i++) {
    if (a[i] <= k) {
      if (cal(k - a[i]) == 2) dp[k] = 1;
      return dp[k];
    }
  }
  dp[k] = 2;
  return dp[k];
}
void solve() {
  int k;
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  dp[0] = 2;
  dp[k] = cal(k);
  if (dp[k] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int main() { solve(); }
