#include <bits/stdc++.h>
using namespace std;
string solve(vector<int>& arr, int k) {
  int dp[k + 1];
  memset(dp, 0, sizeof dp);
  for (int i = 1; i <= k; i++) {
    for (auto move : arr) {
      if (move > i)
        continue;
      else if (dp[i - move] == 0)
        dp[i] = 1;
    }
  }
  return dp[k] ? "First" : "Second";
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> arr(n + 1);
  for (int i = 1; i <= n; i++) cin >> arr[i];
  cout << solve(arr, k);
  return 0;
}
