#include <bits/stdc++.h>
using namespace std;
int mul(int a, int b) { return (long long)a * b % 1000000007; }
int power(int a, int b) {
  int ans = 1;
  while (b > 0) {
    if (b & 1) ans = mul(ans, a);
    a = mul(a, a);
    b >>= 1;
  }
  return ans;
}
long long int p[1000100] = {0};
vector<long long int> v[1000000];
void sieve(long long int n) {
  for (long long int i = 2; i * i <= n; i++) {
    if (!p[i])
      for (long long int j = i; j <= n; j += i) {
        if (i != j)
          ;
        p[j] = 1;
      }
  }
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int factorial(long long int n) {
  if (n == 0) return 1;
  return n * factorial(n - 1);
}
struct segmenttree {
  vector<int> st;
  int n;
  void init(int _n) {
    n = _n;
    st.clear();
    st.resize(4 * _n, 0);
  }
  void update(int l, int r, int indup, int val, int node) {
    if (l == r) {
      st[node] += val;
      return;
    } else {
      int mid = (l + r) / 2;
      if (indup >= l && indup <= mid) {
        update(l, mid, indup, val, node * 2 + 1);
      } else {
        update(mid + 1, r, indup, val, node * 2 + 2);
      }
      st[node] = st[2 * node + 1] + st[2 * node + 2];
    }
  }
  int query(int si, int se, int l, int r, int node) {
    if (se < l || si > r || l > r) {
      return 0;
    }
    if (si >= l && se <= r) {
      return st[node];
    }
    int mid = (si + se) / 2;
    int q1 = query(si, mid, l, r, node * 2 + 1);
    int q2 = query(mid + 1, se, l, r, node * 2 + 2);
    return q1 + q2;
  }
  int query(int l, int r) { return query(0, n - 1, l, r, 0); }
  void update(int index, int val) { update(0, n - 1, index, val, 0); }
} tree;
bool chkcow(long long int n, vector<long long int> &a, long long int k,
            long long int mis) {
  long long int sum = 0;
  for (long long int i = 0; i < n; i++) {
    if (a[i] > mis) sum += a[i] - mis;
    if (sum >= k) return true;
  }
  return false;
}
struct cmp {
  bool operator()(const pair<long long int, long long int> &a,
                  const pair<long long int, long long int> &b) const {
    long long int lena = a.second - a.first;
    long long int lenb = b.second - b.first;
    if (lena == lenb) return a.first < b.first;
    return lena > lenb;
  }
};
string solve(long long int a[], long long int k, long long int n) {
  bool dp[k + 1];
  memset(dp, 0, sizeof dp);
  for (long long int i = 1; i <= k; i++) {
    for (int x = 0; x < n; x++) {
      if (a[x] <= i) {
        if (dp[i - a[x]] == 0) dp[i] = 1;
      }
    }
  }
  cout << "rget";
  return dp[k] ? "First" : "Second";
}
int32_t main() {
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  cout << solve(a, k, n);
  return 0;
}
