#include <bits/stdc++.h>
using namespace std;
bool dp[10100];
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < 10100; i++) {
    dp[i] = false;
  }
  dp[0] = false;
  for (int i = 0; i <= K + 10; i++) {
    for (int j = 0; j < N; j++) {
      if (i >= a[j]) {
        dp[i] |= !dp[i - a[j]];
      }
    }
  }
  if (dp[K] == false) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
  return 0;
}
