#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
const unsigned long long int mod = 1000000007;
const int imx = INT_MAX;
const int imn = INT_MIN;
const long long int lmx = LLONG_MAX;
const long long int lmn = LLONG_MIN;
inline unsigned long long int powm(unsigned long long int x,
                                   unsigned long long int y, bool b = false,
                                   unsigned long long int m = mod) {
  if (b) {
    unsigned long long int t = 1;
    x %= m;
    while (y > 0) {
      if (y % 2) t = (t * x) % m;
      y = y >> 1;
      x = (x * x) % m;
    }
    return t;
  } else {
    unsigned long long int t = 1;
    while (y > 0) {
      if (y & 2) t *= x;
      y = y >> 1;
      x *= x;
    }
    return t;
  }
}
inline long long int gcd(long long int a, long long int b) {
  a = abs(a);
  b = abs(b);
  while (b != 0) {
    long long int c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int f(int a[], int n, int k, int p, map<pair<int, int>, int> d) {
  if (k == 0) return p ^ 1;
  if (k < 0) return p;
  if (d.find(make_pair(k, p)) == d.end()) {
    d[make_pair(k, p)] = p ^ 1;
    for (int(i) = 0; (i) < (n); (i)++)
      if (f(a, n, k - a[i], p ^ 1, d) == p) return d[make_pair(k, p)] = p;
  }
  return d[make_pair(k, p)];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int qw = 0; qw < (n); qw++) cin >> (a)[qw];
  map<pair<int, int>, int> m;
  cout << (f(a, n, k, 0, m) == 0 ? "First" : "Second");
  return 0;
}
