#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
int n, k, temp;
int dp[10002];
void solve() {
  memset(dp, -1, sizeof dp);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> temp;
    arr.push_back(temp);
  }
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    dp[i] = 0;
    for (auto moves : arr) {
      if ((i - moves) >= 0) {
        if (dp[i - moves] == 0) dp[i] = 1;
      }
    }
  }
  if (dp[k] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int main(void) { solve(); }
