#include <bits/stdc++.h>
using namespace std;
bool recursive(vector<int>& nums, int dp[], int K, bool chance) {
  if (K == 0) {
    if (chance == 0)
      return false;
    else
      return true;
  }
  if (dp[K] != -1) return dp[K];
  bool yeah = false;
  chance = !chance;
  for (int i = 0; i < nums.size(); i++) {
    if (K >= nums[i]) yeah = yeah | recursive(nums, dp, K - nums[i], chance);
  }
  if (yeah == false) dp[K] = 0;
  if (yeah == true) dp[K] = 1;
  return dp[K];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int m, n;
  cin >> m >> n;
  vector<int> arr(m);
  for (int i = 0; i < m; i++) cin >> arr[i];
  int dp[100007];
  memset(dp, -1, sizeof(dp));
  bool ans = recursive(arr, dp, n, 0);
  if (ans)
    cout << "First";
  else
    cout << "Second";
}
