#include <bits/stdc++.h>
using namespace std;
long long int p = 1e9 + 7;
int n;
int moves[100];
int ans[100007] = {0};
int solve(int k) {
  if (ans[k]) {
    return ans[k];
  }
  bool ansk = 1;
  for (int i = 0; i < n; i++) {
    if (k >= moves[i]) {
      ansk &= solve(k - moves[i]);
    }
    if (!ansk) {
      break;
    }
  }
  ansk = !ansk;
  if (ansk) {
    ans[k] = 1;
  } else {
    ans[k] = 1;
  }
  return ans[k];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> moves[i];
  }
  ans[0] = 0;
  if (solve(k) == 1) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
