#include <bits/stdc++.h>
using namespace std;
int N, K, a[105];
bool dp[10005];
int main() {
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  dp[0] = 0;
  for (int i = 1; i <= K; i++) {
    bool find = false;
    for (int j = 0; j < N; j++) {
      if (a[j] <= i) {
        if (dp[i - a[j]] == 0) {
          find = true;
        }
      }
    }
    if (find) {
      dp[i] = 1;
    } else {
      dp[i] = 0;
    }
  }
  if (dp[K]) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}
