#include <bits/stdc++.h>
using namespace std;
int solve(int *arr, int n, int k) {
  int dp[n + 1][k + 1];
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j >= arr[i - 1]) dp[i][j] = dp[i][j] | (!dp[i][j - arr[i - 1]]);
    }
  }
  return dp[n][k];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, x, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int ans = solve(arr, n, k);
  if (ans)
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
