#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (int)(n); i++) cin >> a[i];
  sort(a.begin(), a.end(), greater<int>());
  bool dp[101][100001];
  for (int i = 0; i < (int)(k + 1); i++) dp[0][i] = false;
  for (int i = 0; i < (int)(n); i++) {
    for (int j = 0; j < (int)(k + 1); j++) {
      dp[i + 1][j] = dp[i][j];
      if (a[i] <= j) dp[i + 1][j] = (dp[i][j - a[i]]) ? false : true;
    }
  }
  string ans = (dp[n][k]) ? "First" : "Second";
  cout << ans << endl;
  return 0;
}
