#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  int dp[2][k + 1];
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < k + 1; i++) {
    dp[0][i] = 1;
    dp[1][i] = 0;
  }
  for (int i = 0; i < a[0]; i++) {
    dp[0][i] = 1;
    dp[1][i] = 0;
  }
  for (int i = 0; i < n; i++) {
    for (int j = a[i]; j < k + 1; j++) {
      dp[0][j] = min(dp[0][j], dp[1][j - a[i]]);
      dp[1][j] = max(dp[1][j], dp[0][j - a[i]]);
    }
  }
  int ans = dp[0][k];
  if (!ans)
    cout << "First";
  else
    cout << "Second";
  cout << "\n";
  return 0;
}
