#include <bits/stdc++.h>
using namespace std;
void print() { cout << "\n"; }
template <typename T, typename... Args>
void print(T a, Args... args) {
  cout << a << " ";
  print(args...);
}
long long llipowerp(long long x, long long y, long long p = LLONG_MAX) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long binarySearch(vector<int> arr, int l, int r, int x) {
  if (r >= l) {
    long long mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return -1;
}
template <typename T>
inline void printvec(vector<T> inp) {
  for (auto it : inp) cout << it << " ";
  cout << "\n";
}
int n, k;
const int N = 1e5 + 10;
int dp[N];
set<int> a;
int get(int r) {
  if (r == 0) return 0;
  if (r < 0) return 0;
  if (dp[r] != -1) return dp[r];
  if (a.count(r)) {
    dp[r] = 1;
    return 1;
  }
  bool con2 = false;
  for (auto i : a) {
    if (get(r - i) == 1) {
      con2 = true;
      break;
    }
  }
  if (!con2) {
    dp[r] = 0;
    return 0;
  }
  bool con = false;
  for (auto i : a) {
    if (get(r - i) == 0) con = true;
  }
  if (!con) {
    dp[r] = 0;
    return 0;
  } else {
    dp[r] = 1;
    return 1;
  }
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  int x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    a.insert(x);
  }
  if (get(k) == 1)
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
}
