#include <bits/stdc++.h>
using namespace std;
int n, k, a[102];
int dp[102][100002];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  memset(dp, false, sizeof dp);
  for (int i = 1; i <= n; ++i) {
    for (int s = 0; s <= k; ++s) {
      dp[i][s] = dp[i - 1][s];
      if (dp[i][s]) continue;
      if (s >= a[i]) {
        if (!dp[i][s - a[i]]) dp[i][s] = true;
      }
    }
  }
  if (dp[n][k])
    cout << "First";
  else
    cout << "Second";
}
