#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  vector<vector<int>> dp(m + 1, vector<int>(n, 1e9));
  for (auto &i : a) cin >> i;
  dp[0] = a;
  int ans = 1;
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        if (dp[i - 1][k] + a[j] <= m) {
          dp[i][j] = min(dp[i][j], dp[i - 1][k] + a[j]);
        }
      }
    }
    if (*max_element(dp[i].begin(), dp[i].end()) == 1e9) {
      ans = i;
      break;
    }
  }
  if (ans & 1)
    cout << "First" << '\n';
  else
    cout << "Second" << '\n';
  return 0;
}
