#include <bits/stdc++.h>
using namespace std;
int n, k, a[105];
int f[100005][2], cl[100005][2];
int cal(int x, int tt) {
  if (x < a[1]) return 0;
  if (cl[x][tt]) return f[x][tt];
  cl[x][tt] = 1;
  f[x][tt] = 0;
  for (int i = 1; i <= n; i++)
    if (cal(x - a[i], 3 - tt) == 0) {
      f[x][tt] = 1;
      return 1;
    }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  if (cal(k, 1))
    cout << "First";
  else
    cout << "Second";
}
