#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int n, k;
int v[102];
int dp[100002];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> v[i];
  for (int i = 0; i < k; ++i) {
    if (dp[i] == 0) dp[i] = 2;
    for (int j = 1; j <= n; ++j) {
      if (dp[i + v[j]] == 1 || i + v[j] > k) continue;
      dp[i + v[j]] = 3 - dp[i];
    }
  }
  if (dp[k] == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
