#include <bits/stdc++.h>
using namespace std;
int n, k, arr[105], grundy[101005];
int mex(set<int> s) {
  int ans = 0;
  while (s.find(ans) != s.end()) {
    ans++;
  }
  return ans;
}
int find_grundy(int a) {
  if (a == 0) {
    return 0;
  }
  if (grundy[a] != -1) {
    return grundy[a];
  }
  set<int> grundies;
  for (int i = 0; i < n; i++) {
    if (a >= arr[i]) {
      grundies.insert(find_grundy(a - arr[i]));
    }
  }
  return mex(grundies);
}
int main() {
  for (int i = 0; i < 100005; i++) {
    grundy[i] = -1;
  }
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  if (find_grundy(k) != 0) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
