#include <bits/stdc++.h>
using namespace std;
int const MAXn = 1e5 + 2;
bool dp[MAXn];
int arr[MAXn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  sort(arr + 1, arr + n + 1);
  for (int i = k; i > k - arr[1]; i--) dp[i] = true;
  for (int j = k - arr[1]; j >= 1; j--) {
    dp[j] = dp[j + arr[1]] ^ 1;
  }
  for (int i = 2; i <= n; i++) {
    for (int j = k - arr[i]; j >= 1; j--) {
      if (!dp[j]) continue;
      if ((dp[j + arr[i]] ^ 1) == 0) dp[j] = 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (dp[arr[i]]) {
      cout << "First";
      return 0;
    }
  }
  cout << "Second";
  return 0;
}
