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