#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int a[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> a[i + 1];
  }
  vector<vector<int> > dp(n + 1, vector<int>(k + 1, 0));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      if ((j - a[i]) >= 0 && dp[i][j - a[i]] == 0) {
        dp[i][j] = 1;
      } else if (j - a[i] < 0) {
        dp[i][j] = dp[i - 1][j];
      }
    }
  }
  if (dp[n][k] == 1) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
