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