#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e5 + 5;
set<long long> s;
long long dp[100005][2];
long long recur(long long k, long long turn) {
  if (dp[k][turn] != -1) return dp[k][turn];
  if (s.find(k) != s.end()) {
    if (turn == 0) {
      dp[k][turn] = 1;
      return 1;
    } else {
      dp[k][turn] = 0;
      return 0;
    }
  }
  if (k < *(s.begin())) {
    if (turn == 0) {
      dp[k][turn] = 0;
      return 0;
    } else {
      dp[k][turn] = 1;
      return 1;
    }
  }
  if (turn == 1) {
    long long x = 1;
    for (auto it : s) {
      x = x & recur(k - it, 1 - turn);
    }
    if (x == 1) {
      dp[k][turn] = 1;
      return 1;
    } else {
      dp[k][turn] = 0;
      return 0;
    }
  } else {
    long long x = 0;
    for (auto it : s) {
      x = x | recur(k - it, 1 - turn);
    }
    if (x == 1) {
      dp[k][turn] = 1;
      return 1;
    } else {
      dp[k][turn] = 0;
      return 0;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    long long x;
    cin >> x;
    s.insert(x);
  }
  for (int i = 0; i < 100005; i++) {
    dp[i][0] = dp[i][1] = -1;
  }
  long long ans = recur(k, 0);
  if (ans == 1) {
    cout << "First" << endl;
  } else
    cout << "Second" << endl;
  return 0;
}
