#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  int dp[k + 1];
  vector<int> v;
  for (int i = 0; i <= k; i++) dp[i] = 0;
  for (int i = 1; i <= n; i++) {
    int last_element;
    cin >> last_element;
    v.push_back(last_element);
  }
  for (int suppose_sum = 0; suppose_sum <= k; suppose_sum++) {
    for (int first_chosen : v) {
      if (!dp[suppose_sum - first_chosen]) dp[suppose_sum] = 1;
    }
  }
  (dp[k]) ? (cout << "First") : (cout << "Second");
  return 0;
}
