#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long n, k;
long long a[105];
long long grundy[100005];
bool vis[105];
void find(long long ind) {
  for (long long i = 0, _n = (105); i < _n; i++) vis[i] = false;
  for (long long i = 0, _n = (n); i < _n; i++) {
    long long g = grundy[ind - a[i]];
    vis[g] = true;
  }
  for (long long i = 0, _n = (105); i < _n; i++) {
    if (!vis[i]) {
      grundy[ind] = i;
      return;
    }
  }
}
int main() {
  ;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(10);
  cin.exceptions(cin.failbit);
  int t = 1;
  while (t--) {
    cin >> n >> k;
    long long low = 200000000000000ll;
    for (long long i = 0, _n = (n); i < _n; i++) {
      cin >> a[i];
      low = min(a[i], low);
    }
    for (long long i = (low), _b = (k); i <= _b; i++) {
      find(i);
    }
    if (grundy[k]) {
      cout << "First\n";
    } else {
      cout << "Second\n";
    }
  };
}
