#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (n); i++) {
    cin >> a[i];
  }
  int dp[101];
  memset(dp, 0, sizeof(dp));
  dp[0] = -1;
  for (int i = 1; i <= k; i++) {
    bool f = true;
    for (int j = 0; j < (n); j++) {
      if (i >= a[j]) {
        if (dp[i - a[j]] == -1) {
          dp[i] = a[j];
          f = false;
          break;
        }
      }
    }
    if (f) dp[i] = -1;
  }
  if (dp[k] != -1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
