#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int k;
  cin >> k;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  int dp[k + 1];
  dp[0] = 0;
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - arr[j] < 0) dp[i] = 0;
      if (dp[i - arr[j]] == 0) dp[i] = 1;
    }
  }
  if (dp[n])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
