#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int n, k, a[105], ans[100005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  ans[0] = 2;
  for (long long i = 1; i <= k; i++) ans[i] = 0;
  for (long long i = 1; i <= k; i++) {
    for (long long j = 1; j <= n; j++) {
      if (a[j] <= i) {
        if (ans[i - a[j]] == 0) {
          ans[i] = 1;
          break;
        } else if (ans[i - a[j]] == 1)
          ans[i] = 2;
      }
    }
  }
  if (ans[k] == 1)
    cout << "First";
  else
    cout << "Second";
}
