#include <bits/stdc++.h>
using namespace std;
long long int n;
long long int popo = 0;
long long int chomo[100004] = {0};
long long int dp(long long int arr[100004], long long int k) {
  if (k == 0)
    return chomo[k] = 1;
  else {
    if (chomo[k] != 0) return chomo[k];
    for (int i = 0; i < n; ++i) {
      if (arr[i] <= k && dp(arr, k - arr[i]) == 1) {
        popo++;
        return chomo[k - arr[i]] = 1;
      }
    }
    return chomo[k] = 0;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int k;
  cin >> n >> k;
  long long int arr[n];
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  dp(arr, k);
  if (popo % 2 == 0)
    cout << "Second";
  else
    cout << "First";
}
