#include <bits/stdc++.h>
using namespace std;
vector<int> memo;
int dfs(int k, vector<int>& av) {
  if (memo[k] != 0) return memo[k];
  int first_res = -1;
  for (auto a1 : av) {
    if (k - a1 >= 0) {
      int second_res = 1;
      for (auto a2 : av) {
        if (k - a1 - a2 >= 0)
          second_res = min(second_res, dfs(k - a1 - a2, av));
      }
      first_res = max(first_res, second_res);
    }
  }
  return memo[k] = first_res;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (int)(n); ++i) cin >> a[i];
  memo.resize(k + 1);
  cout << (dfs(k, a) == 1 ? "First" : "Second") << '\n';
  return 0;
}
