#include <bits/stdc++.h>
using namespace std;
const int MA = 1e5 + 1;
array<int, 100> arr;
int dp[MA], n;
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= k; i++) {
    for (int i = 0; i < n; i++) {
      int move = arr[i];
      if (move > i) continue;
      if (dp[i - move] == 0) dp[i] = 1;
    }
  }
  if (dp[k])
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
