#include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> v;
vector<vector<vector<int>>> s;
int solution(int sum, int x, int y) {
  sum -= x;
  if (sum < 0) {
    return (y + 1) % 2;
  }
  for (int i = 0; i < v.size(); ++i) {
    int& res = s[sum][i][(y + 1) % 2];
    if (res == -1) {
      res = solution(sum, v[i], (y + 1) % 2);
    }
    if (res == (y + 1) % 2) {
      return (y + 1) % 2;
    }
  }
  return y % 2;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  std::cin >> N >> K;
  v.resize(N);
  s = vector<vector<vector<int>>>(
      K + 1, vector<vector<int>>(N + 1, vector<int>(2, -1)));
  for (int i = 0; i < N; ++i) {
    cin >> v[i];
  }
  for (int i = 0; i < v.size(); ++i) {
    if (solution(K, v[i], 0) == 0) {
      std::cout << "First";
      return 0;
    }
  }
  std::cout << "Second";
  return 0;
}
