#include <bits/stdc++.h>
using namespace std;
int n, k;
const int MAXN = 1e5 + 5;
int vis[MAXN];
int arr[105];
void memo() {
  queue<int> q;
  for (int i = 0; i < arr[0]; i++) {
    q.push(i);
    vis[i] = 1;
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    if (u > k) continue;
    for (int i = 0; i < n; i++) {
      int v = arr[i] + u;
      if (vis[v] == -1) {
        vis[v] = vis[u] ^ 1;
        q.push(v);
      } else {
        if (vis[v] == 1 && vis[u] ^ 1 == 0) vis[v] = 0;
      }
    }
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  memset(vis, -1, sizeof(vis));
  memo();
  if (vis[k] == 0)
    cout << "First\n";
  else if (vis[k] == 1)
    cout << "Second\n";
}
