#include <bits/stdc++.h>
using namespace std;
long long ncr(long long n, long long r) {
  long long i, ans = 1, k = 0;
  if (r == 0)
    return 1;
  else if (n < r)
    return 0;
  for (i = n; i >= n - r + 1; i--) {
    ans *= i;
    ans /= n - i + 1;
  }
  return ans;
}
bool visited[6] = {false};
int n = 6;
vector<int> adj[6];
void max_heapify(int a[100], int i) {
  int l, r, largest = i;
  l = 2 * i + 1;
  r = 2 * i + 2;
  if (l < n && a[l] > a[i]) largest = l;
  if (r < n && a[r] > a[l]) largest = r;
  if (largest != i) {
    int k;
    k = a[i];
    a[i] = a[largest];
    a[largest] = k;
    max_heapify(a, largest);
  }
}
int power(long long x, long long y, long long p) {
  int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool square(long long n) {
  double x;
  x = sqrt(n);
  if (x == floor(x))
    return true;
  else
    return false;
}
bool prime(long long n) {
  long long i;
  for (i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long modi(long long a, long long m) { return power(a, m - 2, m); }
void kmp(string s, long long pi[]) {
  int n = (int)s.length();
  pi[0] = 0;
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
}
void zfunc(string s, long long z[]) {
  long long n = (long long)s.length();
  z[0] = 0;
  for (long long i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
}
struct pair_hash {
  size_t operator()(const pair<int, int>& p) const noexcept {
    return hash<long long>()((((long long)p.first) << 32) |
                             ((long long)p.second));
  }
};
void automaton(string s, long long aut[][26]) {
  long long n = s.size(), pi[1000];
  kmp(s, pi);
  long long i, j;
  for (i = 0; i < n; i++) {
    for (int c = 0; c < 26; c++) {
      if (i > 0 && 'a' + c != s[i])
        aut[i][c] = aut[pi[i - 1]][c];
      else
        aut[i][c] = i + ('a' + c == s[i]);
    }
  }
}
bool palin(string s) {
  long long i, n;
  n = s.length();
  for (i = 0; i <= n / 2; i++) {
    if (s[i] != s[n - i - 1]) {
      return false;
    }
  }
  return true;
}
long long sum(long long n) {
  long long i;
  i = n;
  long long sum = 0;
  while (i > 0) {
    sum += i % 10;
    i = i / 10;
  }
  return sum;
}
long long nCr(long long n, long long r, long long p, long long fac[]) {
  if (r == 0) return 1;
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
  return (fac[n] * modi(fac[r], p) % p * modi(fac[n - r], p) % p) % p;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void bfs(vector<long long>& ans, long long k) {
  queue<long long> q;
  while (!q.empty()) {
    long long temp = q.front();
  }
}
int dp[100001] = {0};
bool f(long long k, vector<long long> v, long long n) {
  if (k == 0) {
    return false;
  }
  bool ans = false;
  bool flag = false;
  for (int j = 0; j < n; j++) {
    if (k - v[j] >= 0) {
      flag = true;
      break;
    }
  }
  if (!flag) {
    dp[k] = -1;
    return false;
  }
  for (int j = 0; j < n; j++) {
    long long u = v[j];
    if (k - u >= 0) {
      if (dp[k - u] != 0) {
        if (dp[k - u] == 1) {
          continue;
        } else {
          dp[k] = 1;
          return true;
        }
      } else {
        if (!f(k - u, v, n)) {
          dp[k] = 1;
          return true;
        }
      }
    }
  }
  if (!ans) {
    dp[k] = -1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long i, j;
  long long t = 1;
  while (t--) {
    vector<long long> v(n);
    long long n, k, x;
    cin >> n >> k;
    for (i = 0; i < n; i++) {
      cin >> v[i];
    }
    if (f(k, v, n)) {
      cout << "First\n";
    } else {
      cout << "Second\n";
    }
  }
}
