#include <bits/stdc++.h>
using namespace std;
class Tree {
 public:
  int root;
  vector<int> next;
  int value = 0;
};
int main(void) {
  int N, K;
  cin >> N;
  cin >> K;
  vector<int> a;
  for (int i = 0; i < N; i++) {
    int num;
    cin >> num;
    a.push_back(num);
  }
  int Min = 100001;
  for (int n = 0; n < N; n++) Min = min(Min, a[n]);
  vector<int> dp(K + 1);
  for (int i = 0; i < Min; i++) dp[i] = 1;
  for (int i = Min; i < K + 1; i++) {
    int judge = 0;
    for (int n = 0; n < N; n++) judge += dp[i - a[n]];
    if (judge == 0)
      dp[i] = 1;
    else
      dp[i] = 0;
  }
  if (dp[K] == 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
