#include <bits/stdc++.h>
using namespace std;
struct obj {
  long long x, y;
};
long long powm(long long, long long);
const int N = 3e0 + 5;
long long tree[4 * N + 1];
long long A[N];
long long lazy[4 * N + 1] = {0};
void build(long long, long long, long long);
void update(long long, long long, long long, long long, long long);
long long query(long long, long long, long long, long long, long long);
void updateRange(long long, long long, long long, long long, long long,
                 long long);
long long queryRange(long long, long long, long long, long long, long long);
long long INF = LLONG_MAX;
const long long M = 1000000007;
long long dp[100005] = {0};
bool solve(long long a[], long long k, long long n, bool p) {
  if (k == 0) return 0;
  if (k < 0) return 1;
  bool win = 0;
  for (int i = 0; i < n; i++) {
    if (dp[k - a[i]] == 2)
      if (!solve(a, k - a[i], n, !p))
        win = 1;
      else {
        if (!dp[k - a[i]]) win = 1;
      }
  }
  dp[k] = win;
  return win;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long k;
  cin >> k;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < 100004; i++) dp[i] = 2;
  bool z = solve(a, k, n, 0);
  if (z)
    cout << "First";
  else
    cout << "Second";
}
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
void build(long long node, long long start, long long end) {
  if (start == end) {
    tree[node] = A[start];
  } else {
    long long mid = (start + end) / 2;
    build(2 * node, start, mid);
    build(2 * node + 1, mid + 1, end);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
  }
}
void update(long long node, long long start, long long end, long long idx,
            long long val) {
  if (start == end) {
    A[idx] += val;
    tree[node] += val;
  } else {
    long long mid = (start + end) / 2;
    if (start <= idx and idx <= mid) {
      update(2 * node, start, mid, idx, val);
    } else {
      update(2 * node + 1, mid + 1, end, idx, val);
    }
    tree[node] = tree[2 * node] + tree[2 * node + 1];
  }
}
long long query(long long node, long long start, long long end, long long l,
                long long r) {
  if (r < start or end < l) {
    return 0;
  }
  if (l <= start and end <= r) {
    return tree[node];
  }
  long long mid = (start + end) / 2;
  long long p1 = query(2 * node, start, mid, l, r);
  long long p2 = query(2 * node + 1, mid + 1, end, l, r);
  return (p1 + p2);
}
void updateRange(long long node, long long start, long long end, long long l,
                 long long r, long long val) {
  if (lazy[node] != 0) {
    tree[node] += (end - start + 1) * lazy[node];
    if (start != end) {
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
  }
  if (start > end or start > r or end < l) return;
  if (start >= l and end <= r) {
    tree[node] += (end - start + 1) * val;
    if (start != end) {
      lazy[node * 2] += val;
      lazy[node * 2 + 1] += val;
    }
    return;
  }
  long long mid = (start + end) / 2;
  updateRange(node * 2, start, mid, l, r, val);
  updateRange(node * 2 + 1, mid + 1, end, l, r, val);
  tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
long long queryRange(long long node, long long start, long long end,
                     long long l, long long r) {
  if (start > end or start > r or end < l) return 0;
  if (lazy[node] != 0) {
    tree[node] += (end - start + 1) * lazy[node];
    if (start != end) {
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
  }
  if (start >= l and end <= r) return tree[node];
  long long mid = (start + end) / 2;
  long long p1 = queryRange(node * 2, start, mid, l, r);
  long long p2 = queryRange(node * 2 + 1, mid + 1, end, l, r);
  return (p1 + p2);
}
